Publikation: Linear Distances between Markov Chains
Lade...
Dateien
Datum
2016
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen 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, 2016, 20. LIPIcs : Leibniz International Proceedings in Informatics. 59. ISSN 1868-8969. ISBN 978-3-95977-017-0. Available under: doi: 10.4230/LIPIcs.CONCUR.2016.20
Zusammenfassung
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.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
probabilistic systems, verification, statistical model checking, temporal logic, behavioural equivalence
Konferenz
27th International Conference on Concurrency Theory : CONCUR 2016, 23. Aug. 2016 - 26. Aug. 2016, Québec City, Canada
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
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, 23. Aug. 2016 - 26. Aug. 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, 2016, 20. LIPIcs : Leibniz International Proceedings in Informatics. 59. ISSN 1868-8969. ISBN 978-3-95977-017-0. Available under: doi: 10.4230/LIPIcs.CONCUR.2016.20BibTex
@inproceedings{Daca2016Linea-42139,
year={2016},
doi={10.4230/LIPIcs.CONCUR.2016.20},
title={Linear Distances between Markov Chains},
number={59},
isbn={978-3-95977-017-0},
issn={1868-8969},
publisher={Schloss Dagstuhl, Leibniz-Zentrum für Informatik GmbH},
address={Saarbrücken/Wadern},
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: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/server/rdf/resource/123456789/42139">
<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:rights>terms-of-use</dc:rights>
<dc:creator>Petrov, Tatjana</dc:creator>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:creator>Henzinger, Thomas A.</dc:creator>
<dc:contributor>Petrov, Tatjana</dc:contributor>
<dc:contributor>Daca, Przemyslaw</dc:contributor>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-04-23T13:20:37Z</dc:date>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:title>Linear Distances between Markov Chains</dcterms:title>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:contributor>Henzinger, Thomas A.</dc:contributor>
<dc:creator>Kretínský, Jan</dc:creator>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/42139/1/Daca_2-1g5yruc0yq68q7.pdf"/>
<dc:language>eng</dc:language>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/42139"/>
<dc:creator>Daca, Przemyslaw</dc:creator>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-04-23T13:20:37Z</dcterms:available>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/42139/1/Daca_2-1g5yruc0yq68q7.pdf"/>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:contributor>Kretínský, Jan</dc:contributor>
<dcterms:issued>2016</dcterms:issued>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
