Counterexamples for Timed Probabilistic Reachability

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:d2d382194123c04008de89d019680dfd

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, pp. 177-195. ISBN 978-3-540-30946-8

@inproceedings{Aljazzar2005Count-5450, title={Counterexamples for Timed Probabilistic Reachability}, year={2005}, number={3829}, isbn={978-3-540-30946-8}, address={Berlin [u.a.]}, publisher={Springer}, 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 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5450"> <dc:contributor>Leue, Stefan</dc:contributor> <dc:creator>Hermanns, Holger</dc:creator> <dc:language>eng</dc:language> <dc:contributor>Aljazzar, Husain</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:31Z</dc:date> <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> <dcterms:title>Counterexamples for Timed Probabilistic Reachability</dcterms:title> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5450"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:31Z</dcterms:available> <dcterms:bibliographicCitation>First. publ. in: Lecture notes in computer science, No. 3829 (2005) , pp. 177-195</dcterms:bibliographicCitation> <dc:creator>Aljazzar, Husain</dc:creator> <dcterms:issued>2005</dcterms:issued> <dc:format>application/pdf</dc:format> <dc:creator>Leue, Stefan</dc:creator> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:rights>deposit-license</dc:rights> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Counterexamples_for_Timed_Probabilistic_Reachability.pdf 49

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto