eCommons

 

Unrestricted Stone Duality for Markov Processes

dc.contributor.authorFurber, Robert
dc.contributor.authorKozen, Dexter
dc.contributor.authorLarsen, Kim
dc.contributor.authorMardare, Radu
dc.contributor.authorPanangaden, Prakash
dc.date.accessioned2017-02-23T20:52:06Z
dc.date.available2017-02-23T20:52:06Z
dc.date.issued2017-02-23
dc.description.abstractStone duality relates logic, in the form of Boolean algebra, to spaces. Stone-type dualities abound in computer science and have been of great use in understanding the relationship between computational models and the languages used to reason about them. Recent work on probabilistic processes has established a Stone-type duality for a restricted class of Markov processes. The dual category was a new notion--Aumann algebras--which are Boolean algebras equipped with countable family of modalities indexed by rational probabilities. In this article we consider an alternative definition of Aumann algebra that leads to dual adjunction for Markov processes that is a duality for many measurable spaces occurring in practice. This extends a duality for measurable spaces due to Sikorski. In particular, we do not require that the probabilistic modalities preserve a distinguished base of clopen sets, nor that morphisms of Markov processes do so. The extra generality allows us to give a perspicuous definition of event bisimulation on Aumann algebras.en_US
dc.identifier.urihttps://hdl.handle.net/1813/46302
dc.language.isoenen_US
dc.subjectStone duality, Aumann algebra, Markov processen_US
dc.titleUnrestricted Stone Duality for Markov Processesen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
UnrestrictedStone.pdf
Size:
357.34 KB
Format:
Adobe Portable Document Format
Description:
Main article