Labelled Markov processes as generalised stochastic relations

DOI10.1016/J.ENTCS.2007.02.015zbMATH Open1277.68198OpenAlexW2127166760MaRDI QIDQ2864159FDOQ2864159

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

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

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)

Cites Work

• 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
• Equational axioms for probabilistic bisimilarity
• Title not available (Why is that?)
• Bisimulation through probabilistic testing
• Title not available (Why is that?)
• Foundations of Software Science and Computation Structures
• Retracing some paths in process algebra
• A domain equation for bisimulation
• Observation equivalence as a testing equivalence
• Semantics of probabilistic programs
• A complete inference system for a class of regular behaviours
• Title not available (Why is that?)
• Probabilistic extensions of process algebras.
• Title not available (Why is that?)
• Domain theory, testing and simulation for labelled Markov processes
• 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)