A metrized duality theorem for Markov processes
DOI10.1016/j.entcs.2014.10.012zbMath1337.68186OpenAlexW2157267904WikidataQ113317843 ScholiaQ113317843MaRDI QIDQ283765
Prakash Panangaden, Radu Mardare, Dexter Kozen
Publication date: 13 May 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2014.10.012
Markov processesisometryStone dualityprobabilistic reasoningmetricsAumann algebrasquantitative reasoning
Continuous-time Markov processes on general state spaces (60J25) Modal logic (including the logic of norms) (03B45) Reasoning under uncertainty in the context of artificial intelligence (68T37) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Other algebras related to logic (03G25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Metrics for labelled Markov processes
- A probabilistic PDL
- Bisimulation through probabilistic testing
- Interactive epistemology. II: Probability
- Bisimulation for labelled Markov processes
- Taking It to the Limit: Approximate Reasoning for Markov Processes
- Deduction Systems for Coalgebras Over Measurable Spaces
- Reasoning about knowledge and probability
- Continuous Markovian Logics - Axiomatization and Quantified Metatheory
- Stone Duality for Markov Processes
- Foundations of Software Science and Computation Structures
- Stochastic Relations
- Foundations of Software Science and Computational Structures
- Probability logic for type spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A metrized duality theorem for Markov processes
