License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2019.9
URN: urn:nbn:de:0030-drops-109119
URL: http://drops.dagstuhl.de/opus/volltexte/2019/10911/
Go to the corresponding LIPIcs Volume Portal


Bacci, Giorgio ; Bacci, Giovanni ; Larsen, Kim G. ; Mardare, Radu ; Tang, Qiyi ; van Breugel, Franck

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata

pdf-format:
LIPIcs-CONCUR-2019-9.pdf (0.6 MB)


Abstract

The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilistic automata. In this paper, we present a novel characterization of the bisimilarity distance as the solution of a simple stochastic game. The characterization gives us an algorithm to compute the distances by applying Condon's simple policy iteration on these games. The correctness of Condon's approach, however, relies on the assumption that the games are stopping. Our games may be non-stopping in general, yet we are able to prove termination for this extended class of games. Already other algorithms have been proposed in the literature to compute these distances, with complexity in UP cap coUP and PPAD. Despite the theoretical relevance, these algorithms are inefficient in practice. To the best of our knowledge, our algorithm is the first practical solution. In the proofs of all the above-mentioned results, an alternative presentation of the Hausdorff distance due to Mémoli plays a central rôle.

BibTeX - Entry

@InProceedings{bacci_et_al:LIPIcs:2019:10911,
  author =	{Giorgio Bacci and Giovanni Bacci and Kim G. Larsen and Radu Mardare and Qiyi Tang and Franck van Breugel},
  title =	{{Computing Probabilistic Bisimilarity Distances for Probabilistic Automata}},
  booktitle =	{30th International Conference on Concurrency Theory (CONCUR 2019)},
  pages =	{9:1--9:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-121-4},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{140},
  editor =	{Wan Fokkink and Rob van Glabbeek},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10911},
  URN =		{urn:nbn:de:0030-drops-109119},
  doi =		{10.4230/LIPIcs.CONCUR.2019.9},
  annote =	{Keywords: Probabilistic automata, Behavioural metrics, Simple stochastic games, Simple policy iteration algorithm}
}

Keywords: Probabilistic automata, Behavioural metrics, Simple stochastic games, Simple policy iteration algorithm
Seminar: 30th International Conference on Concurrency Theory (CONCUR 2019)
Issue Date: 2019
Date of publication: 26.08.2019


DROPS-Home | Imprint | Privacy Published by LZI