2026-07-22T13:39:19Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6182 2024-03-06T10:38:29Z ddc:004 open_access

Linear Distances between Markov Chains Daca, Przemyslaw Henzinger, Thomas A. Kretinsky, Jan Petrov, Tatjana probabilistic systems verification statistical model checking temporal logic behavioural equivalence 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Przemyslaw Daca and Thomas A. Henzinger and Jan Kretinsky and Tatjana Petrov 2016 Is Part Of LIPIcs, Volume 59, 27th International Conference on Concurrency Theory (CONCUR 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2016.20 urn:nbn:de:0030-drops-61829 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.20 eng https://creativecommons.org/licenses/by/3.0/legalcode