Stone duality for markov processes

Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden

Research output: Contribution to journalConference article

15 Citations (Scopus)

Abstract

We define Aumann algebras, an algebraic analog of probabilistic modal logic. An Aumann algebra consists of a Boolean algebra with operators modeling probabilistic transitions. We prove a Stone-type duality between countable Aumann algebras and countably-generated continuous-space Markov processes. Our results subsume existing results on completeness of probabilistic modal logics for Markov processes.

Original languageEnglish
Article number6571564
Pages (from-to)321-330
Number of pages10
JournalProceedings - Symposium on Logic in Computer Science
Early online date1 Aug 2013
DOIs
Publication statusPublished - 9 Sep 2013
Event2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013 - New Orleans, LA, United States
Duration: 25 Jun 201328 Jun 2013

Keywords

  • completeness
  • labelled Markov processes
  • probabilistic modal logics
  • tone-type duality

Fingerprint Dive into the research topics of 'Stone duality for markov processes'. Together they form a unique fingerprint.

  • Cite this

    Kozen, D., Larsen, K. G., Mardare, R., & Panangaden, P. (2013). Stone duality for markov processes. Proceedings - Symposium on Logic in Computer Science, 321-330. [6571564]. https://doi.org/10.1109/LICS.2013.38