Probabilistic transition system specifications (PTSS) provide structural operational semantics for reactive probabilistic labeled transition systems. Bisimulation equivalences and bisimulation metrics are fundamental notions to describe behavioral relations and distances of states, respectively. We provide a method to generate from a PTSS a sound and ground-complete equational axiomatization for strong and convex bisimilarity. The construction is based on the method of Aceto, Bloom and Vaandrager developed for non-deterministic transition system specifications. The novelty in our approach is to employ many-sorted algebras to axiomatize separately non-deterministic choice, probabilistic choice and their interaction. Furthermore, we generalize this method to axiomatize the strong and convex metric bisimulation distance of PTSS. © 2014 Springer-Verlag.
CITATION STYLE
D’Argenio, P. R., Gebler, D., & Lee, M. D. (2014). Axiomatizing bisimulation equivalences and metrics from probabilistic SOS rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8412 LNCS, pp. 289–303). Springer Verlag. https://doi.org/10.1007/978-3-642-54830-7_19
Mendeley helps you to discover research relevant for your work.