Bisimulation and cocongruence for probabilistic systems

DOI10.1016/j.ic.2005.02.004zbMath1110.68083OpenAlexW2078103992MaRDI QIDQ2495642

Josée Desharnais, François Laviolette, Vincent Danos, Prakash Panangaden

Publication date: 30 June 2006

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

coalgebrasprobabilistic bisimulationprobabilistic processescocongruencelabelled Markov processes

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (32)

Approximating bisimilarity for Markov processes ⋮ Approximating Labelled Markov Processes Again! ⋮ Relating Coalgebraic Notions of Bisimulation ⋮ Bisimulation for Feller-Dynkin processes ⋮ Towards a classification of behavioural equivalences in continuous-time Markov processes ⋮ Hennessy-Milner results for probabilistic PDL ⋮ Continuity as a computational effect ⋮ A Demonic Approach to Information in Probabilistic Systems ⋮ A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems ⋮ Unnamed Item ⋮ Expressiveness of probabilistic modal logics: a gradual approach ⋮ Bisimulations for non-deterministic labelled Markov processes ⋮ Weighted and branching bisimilarities from generalized open maps ⋮ THE ZHOU ORDINAL OF LABELLED MARKOV PROCESSES OVER SEPARABLE SPACES ⋮ Behavioural equivalences for continuous-time Markov processes ⋮ Measurable stochastics for Brane calculus ⋮ Lattice properties of congruences for stochastic relations ⋮ Approximating Markov processes through filtration ⋮ Coalgebraic Logic over Measurable Spaces: Behavioral and Logical Equivalence ⋮ Constructive logical characterizations of bisimilarity for reactive probabilistic systems ⋮ Coalgebraic logic over general measurable spaces – a survey ⋮ A logical duality for underspecified probabilistic systems ⋮ Bisimilarity control of partially observed nondeterministic discrete event systems and a test algorithm ⋮ Bisimulation on Markov Processes over Arbitrary Measurable Spaces ⋮ Unprovability of the logical characterization of bisimulation ⋮ Bisimilarity is not Borel ⋮ Open maps in concrete categories and branching bisimulation for prefix orders ⋮ Approximating Markov Processes by Averaging ⋮ Symbolic computation of differential equivalences ⋮ Coalgebraic logic for stochastic right coalgebras ⋮ Structural operational semantics for continuous state stochastic transition systems ⋮ Labelled Markov Processes as Generalised Stochastic Relations

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
• Bisimulation through probabilistic testing
• Approximating labelled Markov processes
• Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Bisimulation for labelled Markov processes
• Finite Continuous Time Markov Chains
• Probability with Martingales
• Semi-pullbacks and bisimulation in categories of Markov processes

This page was built for publication: Bisimulation and cocongruence for probabilistic systems