Rooted branching bisimulation as a congruence for probabilistic transition systems

Matias D. Lee
Erik P. de Vink
(TU/e, Eindhoven)

We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence. The congruence theorem is based on the approach of Fokkink for the qualitative case. For this to work, the theory of transition system specifications in the setting of labeled transition systems needs to be extended to deal with probability distributions, both syntactically and semantically. We provide a scheduler-free characterization of probabilistic branching bisimulation as adapted from work of Andova et al. for the alternating model. Counter examples are given to justify the various conditions required by the format.

In Nathalie Bertrand and Mirco Tribastone: Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL 2015), London, UK, 11th-12th April 2015, Electronic Proceedings in Theoretical Computer Science 194, pp. 79–94.
Published: 28th September 2015.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: