Branching bisimulation for probabilistic systems: Characteristics and decidability |
| |
Authors: | Suzana Andova Tim AC Willemse |
| |
Affiliation: | 1. Department of Computer Science, Twente University P.O. Box 217, 7500 AE Enschede, The Netherlands;2. Institute for Computing and Information Sciences (ICIS), Radboud University Nijmegen P.O. Box 9010, 6500 GL Nijmegen, The Netherlands;3. Department of Mathematics and Computer Science, Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands |
| |
Abstract: | We address the concept of abstraction in the setting of probabilistic reactive systems, and study its formal underpinnings for the strictly alternating model of Hansson. In particular, we define the notion of branching bisimilarity and study its properties by studying two other equivalence relations, viz. coloured trace equivalence and branching bisimilarity using maximal probabilities. We show that both alternatives coincide with branching bisimilarity. The alternative characterisations have their own merits and focus on different aspects of branching bisimilarity. Coloured trace equivalence can be understood without knowledge of probability theory and is independent of the notion of a scheduler. Branching bisimilarity, rephrased in terms of maximal probabilities gives rise to an algorithm of polynomial complexity for deciding the equivalence. Together they give a better understanding of branching bisimilarity. Furthermore, we show that the notions of branching bisimilarity in the alternating model of Hansson and in the non-alternating model of Segala differ: branching bisimilarity in the latter setting turns out to discriminate between systems that are intuitively branching bisimilar. |
| |
Keywords: | Branching bisimulation Probabilistic systems Alternating model Abstraction |
本文献已被 ScienceDirect 等数据库收录! |
|