Communicating sequential processes
Communicating sequential processes
Process algebra
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
Branching bisimilarity is an equivalence indeed!
Information Processing Letters
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
A Calculus of Communicating Systems
A Calculus of Communicating 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
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Branching time and orthogonal bisimulation equivalence
Theoretical Computer Science
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
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
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
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
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
| Hi-index | 0.00 |
The notion of branching bisimulation for the alternating model of probabilistic systems is not a congruence with respect to parallel composition. In this paper we first define another branching bisimulation in the more general model allowing consecutive probabilistic transitions, and we prove that it is compatible with parallel composition. We then show that our bisimulation is actually the coarsest congruence relation included in the existing branching bisimulation when restricted to the alternating model.