[FerrerFHHT16] Deciding Probabilistic Automata Weak Bisimulation: Theory and Practice In Formal Aspects of Computing, 28: 109-143, 2016.
Note: The final publication is available at http://link.springer.com
Downloads: pdf, bibAbstract. Weak probabilistic bisimulation on probabilistic automata can be decided by an algorithm that needs to check a polynomial number of linear programming problems encoding weak transitions.
It is hence of polynomial complexity.
This paper discusses the specific complexity class of the weak probabilistic bisimulation problem, and it considers several practical algorithms and Linear Programming problem transformations that enable an efficient solution.
We then discuss two different implementations of a probabilistic automata weak probabilistic bisimulation minimizer, one of them employing SAT modulo linear arithmetic as the solver technology.
Empirical results demonstrate the effectiveness of the minimization approach on standard benchmarks, also highlighting the benefits of compositional minimization.