On the Complexity of the Equivalence Problem for Probabilistic Automata.

Stefan Kiefer, Andrzej S. Murawski, Jol Ouaknine, Bjrn Wachter, James Worrell

Browse the full FOSSACS paper archive.