An Efficient Algorithm to Determine Probabilistic Bisimulation
AbstractWe provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition systems, featuring non-deterministic choice as well as discrete probabilistic choice. The algorithm is linear in the number of transitions and logarithmic in the number of states, distinguishing both action states and probabilistic states, and the transitions between them. The algorithm improves upon the proposed complexity bounds of the best algorithm addressing the same purpose so far by Baier, Engelen and Majster-Cederbaum (Journal of Computer and System Sciences 60:187–231, 2000). In addition, experimentally, on various benchmarks, our algorithm performs rather well; even on relatively small transition systems, a performance gain of a factor 10,000 can be achieved. View Full-Text
Share & Cite This Article
Groote, J.F.; Rivera Verduzco, J.; De Vink, E.P. An Efficient Algorithm to Determine Probabilistic Bisimulation. Algorithms 2018, 11, 131.
Groote JF, Rivera Verduzco J, De Vink EP. An Efficient Algorithm to Determine Probabilistic Bisimulation. Algorithms. 2018; 11(9):131.Chicago/Turabian Style
Groote, Jan F.; Rivera Verduzco, Jao; De Vink, Erik P. 2018. "An Efficient Algorithm to Determine Probabilistic Bisimulation." Algorithms 11, no. 9: 131.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.