Operational causality – Necessarily sufficient and sufficiently necessary

Research output: Contribution to book/Conference proceedings/Anthology/ReportChapter in book/Anthology/ReportContributed

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.

Details

Original languageEnglish
Title of host publicationA Journey from Process Algebra via Timed Automata to Model Learning
EditorsNils Jansen, Mariëlle Stoelinga, Petra van den Bos
PublisherSpringer, Berlin [u. a.]
Pages27–45
Number of pages19
ISBN (electronic)978-3-031-15629-8
ISBN (print)978-3-031-15628-1
Publication statusPublished - 7 Sept 2022
Peer-reviewedNo

Publication series

SeriesLecture Notes in Computer Science, Volume 13560
ISSN0302-9743

External IDs

Scopus 85138174451
Mendeley 32a40c7e-1a49-305b-8a14-ed00ffba058e
dblp conf/birthday/BaierDFJPZ22
unpaywall 10.1007/978-3-031-15629-8_2
ORCID /0000-0002-5321-9343/work/142236779
ORCID /0000-0002-8490-1433/work/142246191
ORCID /0000-0003-4829-0476/work/165453938

Keywords

Library keywords