From probabilistic counterexamples via causality to fault trees

Cite This

Files in this item

Checksum: MD5:5e52ba9293037137d6b2e206d22f9890

KUNTZ, Matthias, Florian LEITNER-FISCHER, Stefan LEUE, 2011. From probabilistic counterexamples via causality to fault trees. In: FLAMMINI, Francesco, ed., Sandro BOLOGNA, ed., Valeria VITTORINI, ed.. Computer Safety, Reliability, and Security. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 71-84. ISBN 978-3-642-24269-4. Available under: doi: 10.1007/978-3-642-24270-0_6

@inproceedings{Kuntz2011proba-14779, title={From probabilistic counterexamples via causality to fault trees}, year={2011}, doi={10.1007/978-3-642-24270-0_6}, number={6894}, isbn={978-3-642-24269-4}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Computer Safety, Reliability, and Security}, pages={71--84}, editor={Flammini, Francesco and Bologna, Sandro and Vittorini, Valeria}, author={Kuntz, Matthias and Leitner-Fischer, Florian and Leue, Stefan} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dspace:isPartOfCollection rdf:resource=""/> <dc:creator>Leitner-Fischer, Florian</dc:creator> <dcterms:hasPart rdf:resource=""/> <dc:contributor>Leue, Stefan</dc:contributor> <dspace:hasBitstream rdf:resource=""/> <dcterms:rights rdf:resource=""/> <dc:contributor>Leitner-Fischer, Florian</dc:contributor> <bibo:uri rdf:resource=""/> <dcterms:issued>2011</dcterms:issued> <dc:creator>Kuntz, Matthias</dc:creator> <dcterms:bibliographicCitation>First publ. in: Computer safety, reliability, and security : 30th international conference, SAFECOMP 2011, Naples, Italy, September 19-22, 2011 ; proceedings / Francesco Flammini; Sandro Bologna; Valeria Vittorini (eds.). - Heidelberg [u.a.] : Springer, 2011. - S. 71-84. - (Lecture Notes in Computer Science ; 6894)</dcterms:bibliographicCitation> <dc:creator>Leue, Stefan</dc:creator> <dc:language>eng</dc:language> <dcterms:title>From probabilistic counterexamples via causality to fault trees</dcterms:title> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:isPartOf rdf:resource=""/> <dcterms:available rdf:datatype="">2012-07-31T22:25:04Z</dcterms:available> <dc:rights>terms-of-use</dc:rights> <dc:date rdf:datatype="">2011-12-06T16:34:34Z</dc:date> <dcterms:abstract xml:lang="eng">In recent years, several approaches to generate probabilistic counterexamples have been proposed. The interpretation of stochastic counterexamples, however, continues to be problematic since they have to be represented as sets of paths, and the number of paths in this set may be very large. Fault trees (FTs) are a well-established industrial technique to represent causalities for possible system hazards resulting from system or system component failures. In this paper we suggest a method to automatically derive FTs from counterexamples, including a mapping of the probability information onto the FT. We extend the structural equation approach by Pearl and Halpern, which is based on Lewis counterfactuals, so that it serves as a justification for the causality that our proposed FT derivation rules imply. We demonstrate the usefulness of our approach by applying it to an industrial case study.</dcterms:abstract> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Kuntz, Matthias</dc:contributor> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

Leue edit GSPR.pdf 505

This item appears in the following Collection(s)

Search KOPS


My Account