Comparative Analysis of Bisimulation Relations on Alternating and Non-Alternating Probabilistic Models
In Second International Conference on the Quantitative Evaluation
of Systems (QEST)
, pages 44-53, IEEE Computer Society
Downloads: pdf, bibURL: http://doi.ieeecomputersociety.org/10.1109/QEST.2005.9
Abstract. We consider bisimulation and weak bisimulation relations in the context of the Labeled Markov Chains of Hansson and Jonsson, the Concurrent Labeled Markov Chains of Philippou, Lee, and Sokolsky, and the Probabilistic Automata of Segala. We identify a taxonomy of bisimulation relations that captures the existing definitions for each one of the three models, and we compare the relations within each model and across models. The comparison across models is given according to a notion of embedding, where we order the three models by generality and we view objects in less general models as objects of more general models.