Equivalences for Silent Transitions in Probabilistic Systems (Extended Abstract)

Share/Save/Bookmark

Andova, S. and Willemse, T.A.C. (2005) Equivalences for Silent Transitions in Probabilistic Systems (Extended Abstract). Electronic Notes in Theoretical Computer Science (ENTCS), 128 (2). pp. 53-66. ISSN 1571-0661

[img] PDF
Restricted to UT campus only
: Request a copy
241kB
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.
Item Type:Article
Additional information:Proceedings of the 11th International Workshop on Expressiveness in Concurrency (EXPRESS 2004) Valencia, Spain 08-10 September 2010
Copyright:© 2005 Elsevier
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Chair:
Research Group:
Link to this item:http://purl.utwente.nl/publications/76641
Official URL:http://dx.doi.org/10.1016/j.entcs.2004.11.028
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page