Branching bisimulation congruence for probabilistic systems

DOI10.1016/J.TCS.2011.07.020zbMath1234.68282OpenAlexW2020876738MaRDI QIDQ764289

Suzana Andova, Nikola Trčka, Sonja Georgievska

Publication date: 13 March 2012

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.07.020

zbMATH Keywords

process algebraprobabilisticbranching bisimulationnondeterministic systemsparallel compositionPCTL

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 (8)

A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces ⋮ Model independent approach to probabilistic models ⋮ Similarity-based minimization of fuzzy tree automata ⋮ Approximate analyzing of labeled transition systems ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ Raiders of the lost equivalence: probabilistic branching bisimilarity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• Branching time and orthogonal bisimulation equivalence
• Comparative branching-time semantics for Markov chains
• Branching bisimulation for probabilistic systems: characteristics and decidability
• Model checking of probabilistic and nondeterministic systems
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
• Towards Performance Prediction of Compositional Models in Industrial GALS Designs
• Three logics for branching bisimulation
• Branching time and abstraction in bisimulation semantics
• Validation of Stochastic Systems
• Branching Bisimulation Congruence for Probabilistic Systems
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
• CONCUR 2005 – Concurrency Theory
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: Branching bisimulation congruence for probabilistic systems