Branching Bisimulation Congruence for Probabilistic Systems

DOI10.1016/j.entcs.2008.11.023zbMath1286.68356OpenAlexW2135367671MaRDI QIDQ5415667

Sonja Georgievska, Nikola Trčka

Publication date: 13 May 2014

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.2008.11.023

zbMATH Keywords

congruenceprobabilistic systemsbranching bisimulationalternating model

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (max. 100)

Differential privacy in probabilistic systems ⋮ Techniques for Formal Modelling and Analysis of Quantum Systems ⋮ On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems ⋮ Equational Reasoning About Quantum Protocols ⋮ Branching bisimulation congruence for probabilistic systems

Cites Work

• A hierarchy of probabilistic system types
• Branching bisimilarity is an equivalence indeed!
• Branching time and orthogonal bisimulation equivalence
• Branching bisimulation for probabilistic systems: characteristics and decidability
• Process Algebra
• Branching time and abstraction in bisimulation semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Branching Bisimulation Congruence for Probabilistic Systems