A metrized duality theorem for Markov processes

DOI10.1016/J.ENTCS.2014.10.012MaRDI QIDQ283765zbMATHOpenAlexWikidataFDO

Authors Dexter Kozen, Radu Mardare, Prakash Panangaden

Publication date 13 May 2016

Full work available at URL https://doi.org/10.1016/j.entcs.2014.10.012

zbMATH Keywords

Markov processesisometryAumann algebrasmetricsprobabilistic reasoningquantitative reasoningStone duality

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Reasoning under uncertainty in the context of artificial intelligence (68T37) Continuous-time Markov processes on general state spaces (60J25) Modal logic (including the logic of norms) (03B45) Other algebras related to logic (03G25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Taking it to the limit: approximate reasoning for Markov processes
• Approximate reasoning for real-time probabilistic processes
• Metrics for labelled Markov processes
• Approximating Markov Processes by Averaging
• Approximating Markov processes by averaging

Cites work

• scientific article; zbMATH DE number 426295 (Why is no real title available?)
• scientific article; zbMATH DE number 3846844 (Why is no real title available?)
• scientific article; zbMATH DE number 3733226 (Why is no real title available?)
• scientific article; zbMATH DE number 1361128 (Why is no real title available?)
• scientific article; zbMATH DE number 1754609 (Why is no real title available?)
• scientific article; zbMATH DE number 1864592 (Why is no real title available?)
• A probabilistic PDL
• Bisimulation for labelled Markov processes
• Bisimulation through probabilistic testing
• Continuous Markovian logic -- from complete axiomatization to the metric space of formulas
• Continuous Markovian logics -- axiomatization and quantified metatheory
• Deduction systems for coalgebras over measurable spaces
• Foundations of Software Science and Computation Structures
• Foundations of Software Science and Computational Structures
• Interactive epistemology. II: Probability
• Labelled Markov processes.
• Metrics for labelled Markov processes
• Probability logic for type spaces
• Reasoning about knowledge and probability
• Stochastic Relations
• Stone duality for Markov processes
• Taking it to the limit: approximate reasoning for Markov processes

Cited in

(3)

• Duality and cones of Markov processes and their semigroups
• Taking it to the limit: approximate reasoning for Markov processes
• Unrestricted Stone duality for Markov processes

This page was built for publication: A metrized duality theorem for Markov processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283765)