Approximating labelled Markov processes again!
DOI10.1007/978-3-642-03741-2_11zbMATH Open1239.68050OpenAlexW1763211909MaRDI QIDQ2888484FDOQ2888484
Authors: Philippe Chaput, Vincent Danos, 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
Recommendations
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximating labelled Markov processes
- Bisimulation and cocongruence for probabilistic systems
- Bisimulation for labelled Markov processes
- Title not available (Why is that?)
- Bisimulation through probabilistic testing
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Title not available (Why is that?)
- Metrics for labelled Markov processes
- A probabilistic PDL
- Title not available (Why is that?)
- A hierarchy of probabilistic system types
- Inverse Limits of Measure Spaces
- Conditional expectation and the approximation of labelled Markov processes.
Cited In (13)
- A theory for the semantics of stochastic and non-deterministic continuous systems
- Measurable stochastics for Brane calculus
- Approximating Markov Processes by Averaging
- Metrics for labelled Markov processes
- Foundations of Software Science and Computation Structures
- Approximating Markov processes by averaging
- Approximating labelled Markov processes
- Conditional expectation and the approximation of labelled Markov processes.
- Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
- Labelled Markov processes.
- Finite Approximation of LMPs for Exact Verification of Reachability Properties
- Labelled Markov processes as generalised stochastic relations
- Labelled Markov processes: stronger and faster approximations
This page was built for publication: Approximating labelled Markov processes again!
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2888484)
