Counterexamples for Timed Probabilistic Reachability

Aljazzar, Husain; Hermanns, Holger; Leue, Stefan

Counterexamples for Timed Probabilistic Reachability

Dateien

Counterexamples_for_Timed_Probabilistic_Reachability.pdfGröße: 248.29 KBDownloads: 264

Datum

2005

Autor:innen

Aljazzar, Husain

Hermanns, Holger

Leue, Stefan

URI (zitierfähiger Link)

http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-61392

Link zur Lizenz

Attribution-NonCommercial-NoDerivs 2.0 Generic

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

PETTERSSON, Paul, ed. and others. Formal modeling and analysis of timed systems : Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26 - 28, 2005. Berlin [u.a.]: Springer, 2005, pp. 177-195. Lecture notes in computer science. 3829. ISBN 978-3-540-30946-8

Zusammenfassung

The inability to provide counterexamples for the violation of timed probabilistic reachability properties constrains the practical use of CSL model checking for continuous time Markov chains (CTMCs). Counterexamples are essential tools in determining the causes of property violations and are required during debugging. We propose the use of explicit state model checking to determine runs leading into property offending states. Since we are interested in finding paths that carry large amounts of probability mass we employ directed explicit state model checking technology to find such runs using a variety of heuristics guided search algorithms, such as Best First search and Z*. The estimates used in computing the heuristics rely on a uniformisation of the CTMC. We apply our approach to a probabilistic model of the SCSI-2 protocol.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

ALJAZZAR, Husain, Holger HERMANNS, Stefan LEUE, 2005. Counterexamples for Timed Probabilistic Reachability. In: PETTERSSON, Paul, ed. and others. Formal modeling and analysis of timed systems : Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26 - 28, 2005. Berlin [u.a.]: Springer, 2005, pp. 177-195. Lecture notes in computer science. 3829. ISBN 978-3-540-30946-8

BibTex

@inproceedings{Aljazzar2005Count-5450,
  year={2005},
  title={Counterexamples for Timed Probabilistic Reachability},
  number={3829},
  isbn={978-3-540-30946-8},
  publisher={Springer},
  address={Berlin [u.a.]},
  series={Lecture notes in computer science},
  booktitle={Formal modeling and analysis of timed systems : Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26 - 28, 2005},
  pages={177--195},
  editor={Pettersson, Paul},
  author={Aljazzar, Husain and Hermanns, Holger and Leue, Stefan}
}

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/5450">
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:31Z</dc:date>
    <dc:creator>Leue, Stefan</dc:creator>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5450/1/Counterexamples_for_Timed_Probabilistic_Reachability.pdf"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dc:contributor>Hermanns, Holger</dc:contributor>
    <dcterms:abstract xml:lang="eng">The inability to provide counterexamples for the violation of timed probabilistic reachability properties constrains the practical use of CSL model checking for continuous time Markov chains (CTMCs). Counterexamples are essential tools in determining the causes of property violations and are required during debugging. We propose the use of explicit state model checking to determine runs leading into property offending states. Since we are interested in finding paths that carry large amounts of probability mass we employ directed explicit state model checking technology to find such runs using a variety of heuristics guided search algorithms, such as Best First search and Z*. The estimates used in computing the heuristics rely on a uniformisation of the CTMC. We apply our approach to a probabilistic model of the SCSI-2 protocol.</dcterms:abstract>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Hermanns, Holger</dc:creator>
    <dc:creator>Aljazzar, Husain</dc:creator>
    <dcterms:title>Counterexamples for Timed Probabilistic Reachability</dcterms:title>
    <dcterms:issued>2005</dcterms:issued>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5450/1/Counterexamples_for_Timed_Probabilistic_Reachability.pdf"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5450"/>
    <dc:contributor>Aljazzar, Husain</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:31Z</dcterms:available>
    <dc:contributor>Leue, Stefan</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:language>eng</dc:language>
    <dc:format>application/pdf</dc:format>
    <dcterms:bibliographicCitation>First. publ. in: Lecture notes in computer science, No. 3829 (2005) , pp. 177-195</dcterms:bibliographicCitation>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja