Publikation: An Algorithm to Compute a Strict Partial Ordering of Actions in Action Traces
Lade...
Dateien
Datum
2021
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
MARGARIA, Tiziana, ed., Bernhard STEFFEN, ed.. ISoLA 2020 : Leveraging Applications of Formal Methods, Verification and Validation : Tools and Trends : Proceedings, Part IV. Cham: Springer Nature, 2021, pp. 10-26. Lecture Notes in Computer Science. 12479. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-030-83723-5. Available under: doi: 10.1007/978-3-030-83723-5_2
Zusammenfassung
Causality Checking [LL13] computes a causal explanation in the form of minimal action traces that lead to the violations of a reachability property. Causality Checking is implemented in the tool QuantUM [LFL11] that currently only depicts in a fault tree the causal actions in the action traces that lead to a property violation, but not the possible order of these actions. We present an analysis to compute the strict partial order of actions in action traces and succinctly depict these orders by a fault tree. We implemented the analysis in the tool QuantUM. We assess the performance of our algorithm by applying it to several models of different size. The results show that the analysis can compute the action order for thousands of action traces.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, 20. Okt. 2020 - 30. Okt. 2020, Rhodes, Greece
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
KÖLBL, Martin, Stefan LEUE, 2021. An Algorithm to Compute a Strict Partial Ordering of Actions in Action Traces. 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020. Rhodes, Greece, 20. Okt. 2020 - 30. Okt. 2020. In: MARGARIA, Tiziana, ed., Bernhard STEFFEN, ed.. ISoLA 2020 : Leveraging Applications of Formal Methods, Verification and Validation : Tools and Trends : Proceedings, Part IV. Cham: Springer Nature, 2021, pp. 10-26. Lecture Notes in Computer Science. 12479. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-030-83723-5. Available under: doi: 10.1007/978-3-030-83723-5_2BibTex
@inproceedings{Kolbl2021Algor-57572,
year={2021},
doi={10.1007/978-3-030-83723-5_2},
title={An Algorithm to Compute a Strict Partial Ordering of Actions in Action Traces},
number={12479},
isbn={978-3-030-83723-5},
issn={0302-9743},
publisher={Springer Nature},
address={Cham},
series={Lecture Notes in Computer Science},
booktitle={ISoLA 2020 : Leveraging Applications of Formal Methods, Verification and Validation : Tools and Trends : Proceedings, Part IV},
pages={10--26},
editor={Margaria, Tiziana and Steffen, Bernhard},
author={Kölbl, Martin 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/57572">
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/57572"/>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dcterms:abstract xml:lang="eng">Causality Checking [LL13] computes a causal explanation in the form of minimal action traces that lead to the violations of a reachability property. Causality Checking is implemented in the tool QuantUM [LFL11] that currently only depicts in a fault tree the causal actions in the action traces that lead to a property violation, but not the possible order of these actions. We present an analysis to compute the strict partial order of actions in action traces and succinctly depict these orders by a fault tree. We implemented the analysis in the tool QuantUM. We assess the performance of our algorithm by applying it to several models of different size. The results show that the analysis can compute the action order for thousands of action traces.</dcterms:abstract>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/57572/1/Koelbl_2-nmxtx7icteyz7.pdf"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/57572/1/Koelbl_2-nmxtx7icteyz7.pdf"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-05-18T16:01:06Z</dcterms:available>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-05-18T16:01:06Z</dc:date>
<dcterms:issued>2021</dcterms:issued>
<dc:rights>terms-of-use</dc:rights>
<dc:creator>Kölbl, Martin</dc:creator>
<dc:creator>Leue, Stefan</dc:creator>
<dc:contributor>Kölbl, Martin</dc:contributor>
<dcterms:title>An Algorithm to Compute a Strict Partial Ordering of Actions in Action Traces</dcterms:title>
<dc:contributor>Leue, Stefan</dc:contributor>
<dc:language>eng</dc:language>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
</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
Ja
