Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2016.20
URN: urn:nbn:de:0030-drops-61829
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6182/
Daca, Przemyslaw ; Henzinger, Thomas A. ; Kretinsky, Jan ; Petrov, Tatjana
Linear Distances between Markov Chains
| pdf-format: |
|
Abstract
We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by temporal logics or automata. We investigate which of the distances can be approximated by observing the systems, i.e. by black-box testing or simulation, and we provide both negative and positive results.
BibTeX - Entry
@InProceedings{daca_et_al:LIPIcs:2016:6182,
author = {Przemyslaw Daca and Thomas A. Henzinger and Jan Kretinsky and Tatjana Petrov},
title = {{Linear Distances between Markov Chains}},
booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)},
pages = {20:1--20:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-017-0},
ISSN = {1868-8969},
year = {2016},
volume = {59},
editor = {Jos{\'e}e Desharnais and Radha Jagadeesan},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6182},
URN = {urn:nbn:de:0030-drops-61829},
doi = {10.4230/LIPIcs.CONCUR.2016.20},
annote = {Keywords: probabilistic systems, verification, statistical model checking, temporal logic, behavioural equivalence}
}
| Keywords: | probabilistic systems, verification, statistical model checking, temporal logic, behavioural equivalence | |
| Seminar: | 27th International Conference on Concurrency Theory (CONCUR 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 24.08.2016 |
