Probabilistic Barbed Congruence
From MaRDI portal
Publication:2870293
DOI10.1016/j.entcs.2007.07.011zbMath1279.68255OpenAlexW2115124728MaRDI QIDQ2870293
Publication date: 17 January 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.07.011
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (5)
SOS specifications for uniformly continuous operators ⋮ Value-passing CCS with noisy channels ⋮ Compositional bisimulation metric reasoning with Probabilistic Process Calculi ⋮ On the Semantics of Markov Automata ⋮ Probabilistic divide \& congruence: branching bisimilarity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Axiomatizations for probabilistic finite-state behaviors
- Bisimulation through probabilistic testing
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Domain equations for probabilistic processes
- Remarks on Testing Probabilistic Processes
- Equational Axioms for Probabilistic Bisimilarity
- Barbed bisimulation
- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
- Processes, Terms and Cycles: Steps on the Road to Infinity
This page was built for publication: Probabilistic Barbed Congruence