Linear Distances between Markov Chains
Formal Languages and Automata Theory
2016-06-27 v2
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.
Keywords
Cite
@article{arxiv.1605.00186,
title = {Linear Distances between Markov Chains},
author = {Przemysław Daca and Thomas A. Henzinger and Jan Křetínský and Tatjana Petrov},
journal= {arXiv preprint arXiv:1605.00186},
year = {2016}
}