Linear Distances between Markov Chains

Cite This

Files in this item

Checksum: MD5:afc3a687192d825f76f7c6ca9d03f224

DACA, Przemyslaw, Thomas A. HENZINGER, Jan KRETÍNSKÝ, Tatjana PETROV, 2016. Linear Distances between Markov Chains. 27th International Conference on Concurrency Theory : CONCUR 2016. Québec City, Canada, Aug 23, 2016 - Aug 26, 2016. In: DESHARNAIS, Josée, ed., Radha JAGADEESAN, ed.. 27th International Conference on Concurrency Theory : CONCUR'16. Saarbrücken/Wadern:Schloss Dagstuhl, Leibniz-Zentrum für Informatik GmbH, 20. ISSN 1868-8969. ISBN 978-3-95977-017-0. Available under: doi: 10.4230/LIPIcs.CONCUR.2016.20

@inproceedings{Daca2016Linea-42139, title={Linear Distances between Markov Chains}, year={2016}, doi={10.4230/LIPIcs.CONCUR.2016.20}, number={59}, isbn={978-3-95977-017-0}, issn={1868-8969}, address={Saarbrücken/Wadern}, publisher={Schloss Dagstuhl, Leibniz-Zentrum für Informatik GmbH}, series={LIPIcs : Leibniz International Proceedings in Informatics}, booktitle={27th International Conference on Concurrency Theory : CONCUR'16}, editor={Desharnais, Josée and Jagadeesan, Radha}, author={Daca, Przemyslaw and Henzinger, Thomas A. and Kretínský, Jan and Petrov, Tatjana}, note={Article Number: 20} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/42139"> <dc:contributor>Petrov, Tatjana</dc:contributor> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/42139/1/Daca_2-1g5yruc0yq68q7.pdf"/> <dc:rights>terms-of-use</dc:rights> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/42139/1/Daca_2-1g5yruc0yq68q7.pdf"/> <dcterms:issued>2016</dcterms:issued> <dc:contributor>Henzinger, Thomas A.</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-04-23T13:20:37Z</dcterms:available> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Kretínský, Jan</dc:contributor> <dc:language>eng</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Henzinger, Thomas A.</dc:creator> <dcterms:abstract xml:lang="eng">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.</dcterms:abstract> <dc:contributor>Daca, Przemyslaw</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:rights rdf:resource="https://kops.uni-konstanz.de/page/termsofuse"/> <dc:creator>Petrov, Tatjana</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/42139"/> <dcterms:title>Linear Distances between Markov Chains</dcterms:title> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-04-23T13:20:37Z</dc:date> <dc:creator>Kretínský, Jan</dc:creator> <dc:creator>Daca, Przemyslaw</dc:creator> </rdf:Description> </rdf:RDF>

Downloads since Apr 23, 2018 (Information about access statistics)

Daca_2-1g5yruc0yq68q7.pdf 17

This item appears in the following Collection(s)

Search KOPS


Browse

My Account