A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice

DOI10.1007/978-3-030-31175-9_9MaRDI QIDQ6489018FDOQ6489018

Authors: Rob van Glabbeek, Jan Friso Groote, Erik de Vink 

Publication date: 14 March 2024

Recommendations

• scientific article; zbMATH DE number 1754605
• Finite axiomatization for symbolic probabilistic \(\pi \)-calculus
• Raiders of the lost equivalence: probabilistic branching bisimilarity
• Foundations of Software Science and Computational Structures
• Axiomatizations for probabilistic finite-state behaviors

Mathematics Subject Classification ID

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

This page was built for publication: A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489018)