Branching bisimulation congruence for probabilistic systems

Authors:
Suzana Andova;Sonja Georgievska;Nikola Trka
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands and Department of Electrical Engineering, Eindhoven University of Technology, The Netherlands
Venue:
Theoretical Computer Science
Year:
2012

Citing 28
Cited 1

Bisimulation through probabilistic testing

Information and Computation
Three logics for branching bisimulation

Journal of the ACM (JACM)
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
Modeling and verification of randomized distributed real-time systems

Modeling and verification of randomized distributed real-time systems
Time and Probability in Formal Design of Distributed Systems

Time and Probability in Formal Design of Distributed Systems
Probabilistic simulations for probabilistic processes

Nordic Journal of Computing
Axiomatizations for Probabilistic Bisimulation

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Weak Bisimulation for Probabilistic Systems

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Weak Bisimulation is Sound and Complete for PCTL*

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Decision Algorithms for Probabilistic Bisimulation

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Linear Time - Branching Time Spectrum II

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Model Checking of Probabalistic and Nondeterministic Systems

Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Branching time and orthogonal bisimulation equivalence

Theoretical Computer Science
Model checking for a probabilistic branching time logic with fairness

Distributed Computing
A ground-complete axiomatization of finite state processes in process algebra

CONCUR 2005 - Concurrency Theory
Comparative Analysis of Bisimulation Relations on Alternating and Non-Alternating Probabilistic Models

QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Branching bisimulation for probabilistic systems: characteristics and decidability

Theoretical Computer Science - Expressiveness in concurrency
Observing Branching Structure through Probabilistic Contexts

SIAM Journal on Computing
Automatic verification of probabilistic concurrent finite state programs

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Branching Bisimulation Congruence for Probabilistic Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Towards Performance Prediction of Compositional Models in Industrial GALS Designs

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Comparative branching-time semantics for Markov chains

Information and Computation
Process Algebra: Equational Theories of Communicating Processes

Process Algebra: Equational Theories of Communicating Processes
Logical characterizations of bisimulations for discrete probabilistic systems

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Bisimulation minimisation mostly speeds up probabilistic model checking

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Compositional reasoning for probabilistic finite-state behaviors

Processes, Terms and Cycles

A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences

Information and Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

A notion of branching bisimilarity for the alternating model of probabilistic systems, compatible with parallel composition, is defined. For a congruence result, an internal transition immediately followed by a non-trivial probability distribution is not considered inert. A weaker definition of branching bisimilarity for the same model has been given earlier. Here we show that our branching bisimulation is the coarsest congruence for parallel composition that is included in the weaker version. To support the use of the present equivalence as a reduction technique, we also show that probabilistic CTL formulae are preserved by our equivalence, and we provide a polynomial-time algorithm deciding branching bisimilarity.