Linear Distances between Markov Chains

Varování

Publikace nespadá pod Filozofickou fakultu, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.

Autoři	DACA Przemyslaw HENZINGER Thomas A. KŘETÍNSKÝ Jan PETROV Tatjana
Rok publikování	2016
Druh	Článek ve sborníku
Konference	27th International Conference on Concurrency Theory, CONCUR 2016
Fakulta / Pracoviště MU	Fakulta informatiky
Citace
Doi	http://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.20
Obor	Informatika
Klíčová slova	verification; temporal logic; statistical model checking
Popis	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.
Související projekty:	Centrum excelence - Institut teoretické informatiky