Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1365647,
author = {Daca, Przemyslaw and Henzinger, Thomas A. and Křetínský, Jan and Petrov, Tatjana},
address = {Schloss Dagstuhl},
booktitle = {27th International Conference on Concurrency Theory, CONCUR 2016},
doi = {http://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.20},
keywords = {verification; temporal logic; statistical model checking},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Schloss Dagstuhl},
isbn = {978-3-95977-017-0},
pages = {1-15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
title = {Linear Distances between Markov Chains},
year = {2016}
}
TY - JOUR
ID - 1365647
AU - Daca, Przemyslaw - Henzinger, Thomas A. - Křetínský, Jan - Petrov, Tatjana
PY - 2016
TI - Linear Distances between Markov Chains
PB - Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
CY - Schloss Dagstuhl
SN - 9783959770170
KW - verification
KW - temporal logic
KW - statistical model checking
N2 - 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.
ER -
DACA, Przemyslaw, Thomas A. HENZINGER, Jan KŘETÍNSKÝ and Tatjana PETROV. Linear Distances between Markov Chains. Online. In \textit{27th International Conference on Concurrency Theory, CONCUR 2016}. Schloss Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, p.~1-15. ISBN~978-3-95977-017-0. Available from: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.20.
|
