Linear Distances between Markov Chains
| Authors | |
|---|---|
| Year of publication | 2016 |
| Type | Article in Proceedings |
| Conference | 27th International Conference on Concurrency Theory, CONCUR 2016 |
| MU Faculty or unit | |
| Citation | |
| Doi | http://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.20 |
| Field | Informatics |
| Keywords | verification; temporal logic; statistical model checking |
| 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. |
| Related projects: |