@inproceedings{bacci_et_al:LIPIcs:2019:10911,
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: Probabilistic automata, Behavioural metrics, Simple stochastic games, Simple policy iteration algorithm},
    Author = {Bacci, Giorgio and Bacci, Giovanni and Larsen, Kim G. and Mardare, Radu and Tang, Qiyi and van Breugel, Franck},
    BookTitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
    Editor = {Fokkink, Wan and van Glabbeek, Rob},
    File = {COMPUTING PROBABILISTIC BISIMILARITY DISTANCES FOR PROBABILISTIC AUTOMATA1 - 907.01768 - x.pdf},
    ISBN = {978-3-95977-121-4},
    ISSN = {1868-8969},
    Pages = {9:1--9:17},
    Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
    Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    Title = {{Computing Probabilistic Bisimilarity Distances for Probabilistic Automata}},
    URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10911},
    Volume = {140},
    Year = {2019},
    bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2019/10911},
    bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.CONCUR.2019.9},
    date-added = {2021-03-10 15:53:53 +0100},
    date-modified = {2021-03-10 15:53:53 +0100},
    urn = {urn:nbn:de:0030-drops-109119},
    doi = {10.4230/LIPIcs.CONCUR.2019.9}
}

@inproceedings{bacci_et_al:LIPIcs:2019:10911, Address = {Dagstuhl, Germany}, Annote = {Keywords: Probabilistic automata, Behavioural metrics, Simple stochastic games, Simple policy iteration algorithm}, Author = {Bacci, Giorgio and Bacci, Giovanni and Larsen, Kim G. and Mardare, Radu and Tang, Qiyi and van Breugel, Franck}, BookTitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, Editor = {Fokkink, Wan and van Glabbeek, Rob}, File = {COMPUTING PROBABILISTIC BISIMILARITY DISTANCES FOR PROBABILISTIC AUTOMATA1 - 907.01768 - x.pdf}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, Pages = {9:1--9:17}, Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, Series = {Leibniz International Proceedings in Informatics (LIPIcs)}, Title = {{Computing Probabilistic Bisimilarity Distances for Probabilistic Automata}}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10911}, Volume = {140}, Year = {2019}, bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2019/10911}, bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.CONCUR.2019.9}, date-added = {2021-03-10 15:53:53 +0100}, date-modified = {2021-03-10 15:53:53 +0100}, urn = {urn:nbn:de:0030-drops-109119}, doi = {10.4230/LIPIcs.CONCUR.2019.9} }