Stone Duality for Markov Processes

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 theorem between countable Aumann algebras and countably-generated continuous-space Markov proc...

Full description

Saved in:
Bibliographic Details
Published in:2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 321 - 330
Main Authors: Kozen, Dexter, Larsen, Kim G., Mardare, Radu, Panangaden, Prakash
Format: Conference Proceeding
Language:English
Published: IEEE 01.06.2013
Subjects:
Boolean algebra
completeness
Computer science
Extraterrestrial measurements
Labelled Markov processes
Markov processes
Probabilistic logic
Probabilistic modal logics
Stone-type duality
Topology
ISBN:1479904139, 9781479904136
ISSN:1043-6871
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 theorem 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.
ISBN:1479904139
9781479904136
ISSN:1043-6871
DOI:10.1109/LICS.2013.38