A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
From MaRDI portal
Publication:5756596
DOI10.1007/11817949_22zbMath1151.68502OpenAlexW2135324040MaRDI QIDQ5756596
Suzana Andova, Tim A. C. Willemse, Jos C. M. Baeten
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
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)
Related Items
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?, Unnamed Item, On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems, Remarks on Testing Probabilistic Processes, Probabilistic Barbed Congruence