Approximating Labelled Markov Processes Again!

DOI10.1007/978-3-642-03741-2_11zbMath1239.68050OpenAlexW1763211909MaRDI QIDQ2888484

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

Publication date: 1 June 2012

Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/17909841/Chaput_Danos_ET_AL_2009_Approximating_Markov_Processes_by_Averaging.pdf

Mathematics Subject Classification ID

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

Related Items

A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems ⋮ Measurable stochastics for Brane calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics for labelled Markov processes
• A hierarchy of probabilistic system types
• A probabilistic PDL
• Bisimulation through probabilistic testing
• Approximating labelled Markov processes
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Bisimulation and cocongruence for probabilistic systems
• Bisimulation for labelled Markov processes
• Inverse Limits of Measure Spaces
• CONCUR 2003 - Concurrency Theory