Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time

Holger Hermanns, Andrea Turrini. Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time. In Deepak D'Souza, Telikepalli Kavitha, Jaikumar Radhakrishnan, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India. Volume 18 of LIPIcs, pages 435-447, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012. [doi]

No reviews for this publication, yet.