Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation (1996)
| Venue: | Proc. CAV'96, LNCS 1102 |
| Citations: | 20 - 5 self |
BibTeX
@INPROCEEDINGS{Baier96polynomialtime,
author = {Christel Baier},
title = {Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation},
booktitle = {Proc. CAV'96, LNCS 1102},
year = {1996},
pages = {38--49},
publisher = {Springer Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Various models and equivalence relations or preorders for probabilistic processes are proposed in the literature. This paper deals with a model based on labelled transition systems extended to the probabalistic setting and gives an O(n 2 \Delta m) algorithm for testing probabilistic bisimulation and an O(n 5 \Delta m 2 ) algorithm for testing probabilistic simulation where n is the number of states and m the number of transitions in the underlying probabilistic transition systems. 1 Introduction Transition systems have proved to be very useful for modelling concurrent processes. A variety of widely accepted equivalence relations and preorders for such systems support the use of transition systems for the design and verification of concurrent systems. In this context, testing equivalences and preorders become important and have been studied e.g. in [3, 4, 8, 11, 17]. For instance, (strong) bisimulation can be decided in time O(m \Delta log n) [22], weak bisimulation in t...
