Computing Distances between Probabilistic Automata

Mathieu Tracol
(IST Austria)
Josée Desharnais
(Departement d'informatique et de génie logiciel, Université Laval, Québec, Canada)
Abir Zhioua
(Departement d'informatique et de génie logiciel, Université Laval, Québec, Canada)

We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA), that allow some error epsilon. When epsilon is zero we retrieve the usual notions of bisimulation and simulation on PAs. We give logical characterisations of these notions by choosing suitable logics which differ from the elementary ones, L with negation and L without negation, by the modal operator. Using flow networks, we show how to compute the relations in PTIME. This allows the definition of an efficiently computable non-discounted distance between the states of a PA. A natural modification of this distance is introduced, to obtain a discounted distance, which weakens the influence of long term transitions. We compare our notions of distance to others previously defined and illustrate our approach on various examples. We also show that our distance is not expansive with respect to process algebra operators. Although L without negation is a suitable logic to characterise epsilon-(bi)simulation on deterministic PAs, it is not for general PAs; interestingly, we prove that it does characterise weaker notions, called a priori epsilon-(bi)simulation, which we prove to be NP-difficult to decide.

In Mieke Massink and Gethin Norman: Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages (QAPL 2011), Saarbrücken, Germany, April 1-3, 2011, Electronic Proceedings in Theoretical Computer Science 57, pp. 148–162.
Published: 4th July 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.57.11 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org