Unrestricted stone duality for Markov processes

Robert Furber, Dexter Kozen, Kim Larsen, Radu Mardare, Prakash Panangaden

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

6 Citations (Scopus)
6 Downloads (Pure)


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.

Original languageEnglish
Title of host publication2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Place of PublicationPiscataway, NJ.
Number of pages9
ISBN (Print)9781509030194
Publication statusPublished - 18 Aug 2017
Event32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017 - Reykjavik, Iceland
Duration: 20 Jun 201723 Jun 2017


Conference32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017


  • Markov processes
  • extraterrestrial measurements
  • boolean algebra
  • probabilistic logics
  • computational modeling
  • topology
  • duality (mathematics)
  • set theory


Dive into the research topics of 'Unrestricted stone duality for Markov processes'. Together they form a unique fingerprint.

Cite this