Equivalences for Silent Transitions in Probabilistic Systems: (Extended Abstract) |
| |
Authors: | S Andova TAC Willemse |
| |
Affiliation: | aDepartment of Computer Science, Twente University, P.O. Box 217, 7500 AE Enschede, The Netherlands;bNijmegen Institute for Computing and Information Sciences (NIII), Radboud University Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands |
| |
Abstract: | We address abstraction in the setting of probabilistic reactive systems, and study its formal underpinnings for the strictly alternating model. 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. Together they give a better understanding of branching bisimilarity. A crucial observation, and, in fact a major motivation for this work is that the notions of branching bisimilarity in the alternating and in the non-alternating model differ, and that the latter one discriminates between systems that are intuitively branching bisimilar. |
| |
Keywords: | Process theory abstraction branching bisimulation probabilistic systems coloured trace equivalence |
本文献已被 ScienceDirect 等数据库收录! |
|