BFL: a Logic to Reason about Fault Trees

Research output: Working paperPreprintAcademic

12 Downloads (Pure)

Abstract

Safety-critical infrastructures must operate safely and reliably. Fault tree analysis is a widespread method used to assess risks in these systems: fault trees (FTs) are required - among others - by the Federal Aviation Authority, the Nuclear Regulatory Commission, in the ISO26262 standard for autonomous driving and for software development in aerospace systems. Although popular both in industry and academia, FTs lack a systematic way to formulate powerful and understandable analysis queries. In this paper, we aim to fill this gap and introduce Boolean Fault tree Logic (BFL), a logic to reason about FTs. BFL is a simple, yet expressive logic that supports easier formulation of complex scenarios and specification of FT properties. Alongside BFL, we present model checking algorithms based on binary decision diagrams (BDDs) to analyse specified properties in BFL, patterns and an algorithm to construct counterexamples. Finally, we propose a case-study application of BFL by analysing a COVID19-related FT.
Original languageEnglish
PublisherArXiv.org
DOIs
Publication statusPublished - 29 Aug 2022

Keywords

  • cs.SE

Fingerprint

Dive into the research topics of 'BFL: a Logic to Reason about Fault Trees'. Together they form a unique fingerprint.
  • BFL: a Logic to Reason about Fault Trees

    Nicoletti, S. M., Hahn, E. M. & Stoelinga, M. I. A., 30 Jun 2022, 2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN). IEEE, p. 441-452 12 p. 9833769

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    5 Citations (Scopus)
    49 Downloads (Pure)

Cite this