Labelled Markov Processes as Generalised Stochastic Relations

DOI10.1016/j.entcs.2007.02.015zbMath1277.68198OpenAlexW2127166760MaRDI QIDQ2864159

Dusko Pavlovic, Michael W. Mislove, James Worrell

Publication date: 6 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

\(C^*\)-algebraStone dualityprobabilistic bisimulationcomonadlabelled Markov processgeneralized stochastic relation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Observation equivalence as a testing equivalence
• A complete inference system for a class of regular behaviours
• Semantics of probabilistic programs
• Bisimulation through probabilistic testing
• Approximating labelled Markov processes
• Domain theory, testing and simulation for labelled Markov processes
• Bisimulation and cocongruence for probabilistic systems
• Bisimulation for labelled Markov processes
• A domain equation for bisimulation
• Equational Axioms for Probabilistic Bisimilarity
• The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions
• Foundations of Software Science and Computation Structures
• Retracing some paths in process algebra