Abstract
We study complete axiomatizations for different notions of probabilistic bisimulation on a recursion free process algebra with probability and nondeterminism under alternating and non-alternating semantics. The axioms that do not involve probability coincide with the original axioms of Milner. The axioms that involve probability differ depending on the bisimulation under examination and on the semantics that is used, thus revealing the implications of the different choices. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Bandini, E., & Segala, R. (2001). Axiomatizations for probabilistic bisimulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2076 LNCS, pp. 370–381). Springer Verlag. https://doi.org/10.1007/3-540-48224-5_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
