Abstract
We consider the problem of approximating and computing a bisimilarity pseudometric on the state space of a probabilistic automaton. We show that the distances are rational and that both approximation and exact computation of distances are in PPAD. In the proofs, a generalization of the classical game-theoretic characterization of bisimilarity, given in terms of simple stochastic games, plays a central role. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Van Breugel, F., & Worrell, J. (2014). The complexity of computing a bisimilarity pseudometric on probabilistic automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8464 LNCS, pp. 191–213). Springer Verlag. https://doi.org/10.1007/978-3-319-06880-0_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
