Approximating Markov Processes by Averaging

DOI10.1145/2537948zbMath1295.68167OpenAlexW2029839940MaRDI QIDQ5895176

Philippe Chaput, Prakash Panangaden, Vincent Danos, Gordon D. Plotkin

Publication date: 12 September 2014

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://doi.acm.org/10.1145/2537948

zbMATH Keywords

modal logicdualityMarkov processesapproximationbisimulationMarkov operators

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Transition functions, generators and resolvents (60J35) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

A categorical characterization of relative entropy on standard Borel spaces, Bisimulation for Feller-Dynkin processes, Borel kernels and their approximation, categorically, Dirichlet is natural, Pointless Learning, Giry and the Machine, A categorical characterization of relative entropy on standard Borel spaces, Unnamed Item, Moment Semantics for Reversible Rule-Based Systems

Uses Software

• QPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics for labelled Markov processes
• A hierarchy of probabilistic system types
• Stochastic coalgebraic logic
• A probabilistic PDL
• One-parameter semigroups of positive operators
• Bisimulation through probabilistic testing
• Approximating labelled Markov processes
• Bisimulation from open maps
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Bisimulation and cocongruence for probabilistic systems
• Bisimulation for labelled Markov processes
• Operator-theoretical treatment of Markoff's process and mean ergodic theorem
• Inverse Limits of Measure Spaces
• Continuous Previsions
• Testing Semantics: Connecting Processes and Process Logics
• Algebraic laws for nondeterminism and concurrency
• Probability with Martingales
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Semi-pullbacks and bisimulation in categories of Markov processes
• Foundations of Software Science and Computation Structures
• Stochastic Relations
• Continuous Capacities on Continuous State Spaces
• Simulation Hemi-metrics between Infinite-State Stochastic Games
• Prevision Domains and Convex Powercones
• Introdction to Measure and Probability
• Approximation theorems for Markov operators
• Foundations of Software Science and Computational Structures
• CONCUR 2003 - Concurrency Theory