Probabilistic barbed congruence
DOI10.1016/J.ENTCS.2007.07.011zbMATH Open1279.68255OpenAlexW2115124728MaRDI QIDQ2870293FDOQ2870293
Authors: Yuxin Deng, Wenjie Du
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
Recommendations
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Equational axioms for probabilistic bisimilarity
- Title not available (Why is that?)
- Bisimulation through probabilistic testing
- Barbed bisimulation
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Axiomatizations for probabilistic finite-state behaviors
- Remarks on testing probabilistic processes
- Domain equations for probabilistic processes
- Processes, Terms and Cycles: Steps on the Road to Infinity
- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
Cited In (5)
This page was built for publication: Probabilistic barbed congruence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870293)