Linear Distances between Markov Chains

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00088470" target="_blank" >RIV/00216224:14330/16:00088470 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.20" target="_blank" >http://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.20</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.20" target="_blank" >10.4230/LIPIcs.CONCUR.2016.20</a>

Result language
angličtina
Original language name
Linear Distances between Markov Chains
Original language description
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.
Czech name
—
Czech description
—

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
27th International Conference on Concurrency Theory, CONCUR 2016
ISBN
9783959770170
ISSN
1868-8969
e-ISSN
—
Number of pages
15
Pages from-to
1-15
Publisher name
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Place of publication
Schloss Dagstuhl
Event location
Schloss Dagstuhl
Event date
Jan 1, 2016
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—

Similar results(10)