Unrestricted stone duality for Markov processes

Furber, Robert and Kozen, Dexter and Larsen, Kim and Mardare, Radu and Panangaden, Prakash; (2017) Unrestricted stone duality for Markov processes. In: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, ISL, pp. 1-9. ISBN 9781509030194 (https://doi.org/10.1109/LICS.2017.8005152)

[thumbnail of Furber-etal-LICS-2017-Unrestricted-stone-duality-for-Markov-processes]
Text. Filename: Furber_etal_LICS_2017_Unrestricted_stone_duality_for_Markov_processes.pdf
Accepted Author Manuscript

Download (295kB)| Preview


Stone 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.