Labelled Markov processes as generalised stochastic relations

DOI10.1016/J.ENTCS.2007.02.015MaRDI QIDQ2864159zbMATH OpenOpenAlexFDO

Authors Dusko Pavlovic, Michael 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^*\)-algebraprobabilistic bisimulationStone dualitycomonadlabelled Markov processgeneralized stochastic relation

Mathematics Subject Classification ID

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

Recommendations

• Foundations of Software Science and Computation Structures
• Labelled Markov processes.
• Approximating labelled Markov processes again!
• Domain theory, testing and simulation for labelled Markov processes
• scientific article; zbMATH DE number 2086650

Cites work

• scientific article; zbMATH DE number 3764843 (Why is no real title available?)
• scientific article; zbMATH DE number 3787631 (Why is no real title available?)
• scientific article; zbMATH DE number 1361128 (Why is no real title available?)
• scientific article; zbMATH DE number 233974 (Why is no real title available?)
• scientific article; zbMATH DE number 3245885 (Why is no real title available?)
• scientific article; zbMATH DE number 3347047 (Why is no real title available?)
• A complete inference system for a class of regular behaviours
• A domain equation for bisimulation
• Approximating labelled Markov processes
• Bisimulation and cocongruence for probabilistic systems
• Bisimulation for labelled Markov processes
• Bisimulation through probabilistic testing
• Domain theory, testing and simulation for labelled Markov processes
• Equational axioms for probabilistic bisimilarity
• Foundations of Software Science and Computation Structures
• Observation equivalence as a testing equivalence
• Probabilistic extensions of process algebras.
• Retracing some paths in process algebra
• Semantics of probabilistic programs
• The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions

Cited in

(3)

• A logical duality for underspecified probabilistic systems
• Metrics for labelled Markov processes
• Foundations of Software Science and Computation Structures

This page was built for publication: Labelled Markov processes as generalised stochastic relations

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