eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2012-12-14
435
447
10.4230/LIPIcs.FSTTCS.2012.435
article
Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time
Hermanns, Holger
Turrini, Andrea
Deciding in an efficient way weak probabilistic bisimulation in the context of probabilistic automata is an open problem for about a decade. In this work we close this problem by proposing a procedure that checks in polynomial time the existence of a weak combined transition satisfying the step condition of the bisimulation. This enables us to arrive at a polynomial time algorithm for deciding weak probabilistic bisimulation. We also present several extensions to interesting related problems setting the ground for the development of more effective and compositional analysis algorithms for probabilistic systems.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol018-fsttcs2012/LIPIcs.FSTTCS.2012.435/LIPIcs.FSTTCS.2012.435.pdf
Probabilistic Automata
Weak probabilsitic bisimulation
Linear Programming problem
Polynomial decision algorithm