Computing Probabilistic Bisimilarity Distances for Probabilistic Automata

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

2 Citationer (Scopus)
13 Downloads (Pure)

Abstrakt

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.
OriginalsprogEngelsk
Titel30th International Conference on Concurrency Theory (CONCUR 2019)
RedaktørerWan Fokkink, Rob van Glabbeek
Antal sider17
ForlagSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH
Publikationsdato2019
Sider9:1-9:17
Artikelnummer9
ISBN (Trykt)978-3-95977-121-4
DOI
StatusUdgivet - 2019
Begivenhed30th International Conference on Concurrency Theory - Amsterdam, Holland
Varighed: 26 aug. 201931 aug. 2019
Konferencens nummer: 30
https://event.cwi.nl/concur2019/

Konference

Konference30th International Conference on Concurrency Theory
Nummer30
LandHolland
ByAmsterdam
Periode26/08/201931/08/2019
Internetadresse
NavnLeibniz International Proceedings in Informatics
Vol/bind140
ISSN1868-8969

Citationsformater