Rooted branching bisimulation as a congruence for probabilistic transition systems

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 sp...

Full description

Saved in:
Bibliographic Details
Published in:Electronic proceedings in theoretical computer science 2015-09, Vol.194 (Proc. QAPL 2015), p.79-94
Main Authors: Lee, Matias D., de Vink, Erik P.
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2075-2180
2075-2180
DOI:10.4204/EPTCS.194.6