Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time

Holger Hermanns, Andrea Turrini

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 p…