Operational Causality - Necessarily Sufficient and Sufficiently Necessary

Christel Baier; Clemens Dubslaff; Florian Funke; Simon Jantsch; Jakob Piribauer; Robin Ziemek

doi:10.1007/978-3-031-15629-8_2

Operational Causality - Necessarily Sufficient and Sufficiently Necessary

Christel Baier, Clemens Dubslaff, Florian Funke, Simon Jantsch, Jakob Piribauer, Robin Ziemek

Algorithms and Logics for Verification

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Citations (Scopus)

Abstract

Necessity and sufficiency are well-established notions in logic and causality analysis, but have barely received attention in the formal methods community. In this paper, we present temporal logic characterizations of necessary and sufficient causes in terms of state sets in operational system models. We introduce degrees of necessity and sufficiency as quality measures for sufficient and necessary causes, respectively, along with a versatile weight-based approach to find “good causes”. The resulting optimization problems of finding optimal causes are shown to be solvable in polynomial time.

Original language	English
Title of host publication	A Journey from Process Algebra via Timed Automata to Model Learning
Pages	27-45
Number of pages	19
DOIs	https://doi.org/10.1007/978-3-031-15629-8_2
Publication status	Published - 2022

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13560 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Bibliographical note

DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

Access to Document

10.1007/978-3-031-15629-8_2

Cite this

Baier, C., Dubslaff, C., Funke, F., Jantsch, S., Piribauer, J., & Ziemek, R. (2022). Operational Causality - Necessarily Sufficient and Sufficiently Necessary. In A Journey from Process Algebra via Timed Automata to Model Learning (pp. 27-45). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13560 LNCS). https://doi.org/10.1007/978-3-031-15629-8_2

@inproceedings{38402cd6bc2a454aa5ecfdf33efabc26,

title = "Operational Causality - Necessarily Sufficient and Sufficiently Necessary",

abstract = "Necessity and sufficiency are well-established notions in logic and causality analysis, but have barely received attention in the formal methods community. In this paper, we present temporal logic characterizations of necessary and sufficient causes in terms of state sets in operational system models. We introduce degrees of necessity and sufficiency as quality measures for sufficient and necessary causes, respectively, along with a versatile weight-based approach to find “good causes”. The resulting optimization problems of finding optimal causes are shown to be solvable in polynomial time.",

author = "Christel Baier and Clemens Dubslaff and Florian Funke and Simon Jantsch and Jakob Piribauer and Robin Ziemek",

note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2022",

doi = "10.1007/978-3-031-15629-8_2",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "27--45",

booktitle = "A Journey from Process Algebra via Timed Automata to Model Learning",

}

Baier, C, Dubslaff, C, Funke, F, Jantsch, S, Piribauer, J & Ziemek, R 2022, Operational Causality - Necessarily Sufficient and Sufficiently Necessary. in A Journey from Process Algebra via Timed Automata to Model Learning. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13560 LNCS, pp. 27-45. https://doi.org/10.1007/978-3-031-15629-8_2

Operational Causality - Necessarily Sufficient and Sufficiently Necessary. / Baier, Christel; Dubslaff, Clemens; Funke, Florian et al.
A Journey from Process Algebra via Timed Automata to Model Learning. 2022. p. 27-45 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13560 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Operational Causality - Necessarily Sufficient and Sufficiently Necessary

AU - Baier, Christel

AU - Dubslaff, Clemens

AU - Funke, Florian

AU - Jantsch, Simon

AU - Piribauer, Jakob

AU - Ziemek, Robin

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2022

Y1 - 2022

N2 - Necessity and sufficiency are well-established notions in logic and causality analysis, but have barely received attention in the formal methods community. In this paper, we present temporal logic characterizations of necessary and sufficient causes in terms of state sets in operational system models. We introduce degrees of necessity and sufficiency as quality measures for sufficient and necessary causes, respectively, along with a versatile weight-based approach to find “good causes”. The resulting optimization problems of finding optimal causes are shown to be solvable in polynomial time.

AB - Necessity and sufficiency are well-established notions in logic and causality analysis, but have barely received attention in the formal methods community. In this paper, we present temporal logic characterizations of necessary and sufficient causes in terms of state sets in operational system models. We introduce degrees of necessity and sufficiency as quality measures for sufficient and necessary causes, respectively, along with a versatile weight-based approach to find “good causes”. The resulting optimization problems of finding optimal causes are shown to be solvable in polynomial time.

UR - http://www.scopus.com/inward/record.url?scp=85138174451&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-15629-8_2

DO - 10.1007/978-3-031-15629-8_2

M3 - Conference contribution

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 27

EP - 45

BT - A Journey from Process Algebra via Timed Automata to Model Learning

ER -

Baier C, Dubslaff C, Funke F, Jantsch S, Piribauer J, Ziemek R. Operational Causality - Necessarily Sufficient and Sufficiently Necessary. In A Journey from Process Algebra via Timed Automata to Model Learning. 2022. p. 27-45. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-15629-8_2

Operational Causality - Necessarily Sufficient and Sufficiently Necessary

Abstract

Publication series

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this