From probabilistic counterexamples via causality to fault trees

dc.contributor.authorKuntz, Matthias
dc.contributor.authorLeitner-Fischer, Florian
dc.contributor.authorLeue, Stefan
dc.date.accessioned2011-12-06T16:34:34Zdeu
dc.date.available2012-07-31T22:25:04Zdeu
dc.date.issued2011
dc.description.abstractIn 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.eng
dc.description.versionpublished
dc.identifier.citationFirst 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)deu
dc.identifier.doi10.1007/978-3-642-24270-0_6deu
dc.identifier.ppn354586823deu
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/14779
dc.language.isoengdeu
dc.legacy.dateIssued2011-12-06deu
dc.rightsterms-of-usedeu
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/deu
dc.subjectcounterexampledeu
dc.subjectfault treedeu
dc.subjectcausalitydeu
dc.subjectprobabilistic model checkingdeu
dc.subject.ddc004deu
dc.titleFrom probabilistic counterexamples via causality to fault treeseng
dc.typeINPROCEEDINGSdeu
dspace.entity.typePublication
kops.citation.bibtex
@inproceedings{Kuntz2011proba-14779,
  year={2011},
  doi={10.1007/978-3-642-24270-0_6},
  title={From probabilistic counterexamples via causality to fault trees},
  number={6894},
  isbn={978-3-642-24269-4},
  publisher={Springer Berlin Heidelberg},
  address={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}
}
kops.citation.iso690KUNTZ, 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, 2011, pp. 71-84. Lecture Notes in Computer Science. 6894. ISBN 978-3-642-24269-4. Available under: doi: 10.1007/978-3-642-24270-0_6deu
kops.citation.iso690KUNTZ, 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, 2011, pp. 71-84. Lecture Notes in Computer Science. 6894. ISBN 978-3-642-24269-4. Available under: doi: 10.1007/978-3-642-24270-0_6eng
kops.citation.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/14779">
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:issued>2011</dcterms:issued>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Kuntz, Matthias</dc:creator>
    <dc:contributor>Leue, Stefan</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/14779/1/Leue%20edit%20GSPR.pdf"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/14779"/>
    <dc:contributor>Kuntz, Matthias</dc:contributor>
    <dcterms:title>From probabilistic counterexamples via causality to fault trees</dcterms:title>
    <dc:creator>Leue, Stefan</dc:creator>
    <dc:creator>Leitner-Fischer, Florian</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>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/14779/1/Leue%20edit%20GSPR.pdf"/>
    <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/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-12-06T16:34:34Z</dc:date>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-07-31T22:25:04Z</dcterms:available>
    <dc:contributor>Leitner-Fischer, Florian</dc:contributor>
    <dc:language>eng</dc:language>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
  </rdf:Description>
</rdf:RDF>
kops.description.openAccessopenaccessgreen
kops.flag.knbibliographytrue
kops.identifier.nbnurn:nbn:de:bsz:352-147797deu
kops.sourcefieldFLAMMINI, Francesco, ed., Sandro BOLOGNA, ed., Valeria VITTORINI, ed.. <i>Computer Safety, Reliability, and Security</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 71-84. Lecture Notes in Computer Science. 6894. ISBN 978-3-642-24269-4. Available under: doi: 10.1007/978-3-642-24270-0_6deu
kops.sourcefield.plainFLAMMINI, Francesco, ed., Sandro BOLOGNA, ed., Valeria VITTORINI, ed.. Computer Safety, Reliability, and Security. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 71-84. Lecture Notes in Computer Science. 6894. ISBN 978-3-642-24269-4. Available under: doi: 10.1007/978-3-642-24270-0_6deu
kops.sourcefield.plainFLAMMINI, Francesco, ed., Sandro BOLOGNA, ed., Valeria VITTORINI, ed.. Computer Safety, Reliability, and Security. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 71-84. Lecture Notes in Computer Science. 6894. ISBN 978-3-642-24269-4. Available under: doi: 10.1007/978-3-642-24270-0_6eng
kops.submitter.emailflorian.leitner@uni-konstanz.dedeu
relation.isAuthorOfPublicationf6b82c58-6530-46da-b7f5-074cfaf5419c
relation.isAuthorOfPublication5ebdded0-0db7-4d45-a83c-bc9aeb9fa926
relation.isAuthorOfPublicationa0cf1380-ebf9-403b-a02e-6e97bae25ef6
relation.isAuthorOfPublication.latestForDiscoveryf6b82c58-6530-46da-b7f5-074cfaf5419c
source.bibliographicInfo.fromPage71
source.bibliographicInfo.seriesNumber6894
source.bibliographicInfo.toPage84
source.contributor.editorFlammini, Francesco
source.contributor.editorBologna, Sandro
source.contributor.editorVittorini, Valeria
source.identifier.isbn978-3-642-24269-4
source.publisherSpringer Berlin Heidelberg
source.publisher.locationBerlin, Heidelberg
source.relation.ispartofseriesLecture Notes in Computer Science
source.titleComputer Safety, Reliability, and Security

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
Leue edit GSPR.pdf
Größe:
5.93 MB
Format:
Adobe Portable Document Format
Leue edit GSPR.pdf
Leue edit GSPR.pdfGröße: 5.93 MBDownloads: 435

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
license.txt
Größe:
1.92 KB
Format:
Plain Text
Beschreibung:
license.txt
license.txtGröße: 1.92 KBDownloads: 0