A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
DOI10.1007/11817949_22zbMATH Open1151.68502OpenAlexW2135324040MaRDI QIDQ5756596FDOQ5756596
Authors: S. Andova, Jos C. M. Baeten, T. A. C. Willemse 
Publication date: 4 September 2007
Published in: CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11817949_22
Recommendations
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- scientific article; zbMATH DE number 1701760
- scientific article; zbMATH DE number 3958712
- scientific article; zbMATH DE number 1754605
- Branching bisimulation for probabilistic systems: characteristics and decidability
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)
Cited In (10)
- Probabilistic verification of communication protocols
- Title not available (Why is that?)
- Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
- Title not available (Why is that?)
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- Remarks on testing probabilistic processes
- Title not available (Why is that?)
- Probabilistic barbed congruence
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
- Title not available (Why is that?)
This page was built for publication: A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756596)
