A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification

DOI10.1007/11817949_22MaRDI QIDQ5756596zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Network protocols (68M12) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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

Cited in

(11)

• Process algebra with language matching
• Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
• scientific article; zbMATH DE number 1701760 (Why is no real title available?)
• Remarks on testing probabilistic processes
• Probabilistic barbed congruence
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
• scientific article; zbMATH DE number 3958712 (Why is no real title available?)
• scientific article; zbMATH DE number 1754605 (Why is no real title available?)
• Discovering ePassport vulnerabilities using bisimilarity
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
• Probabilistic verification of communication protocols

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)