Integrating satisfiability solving in the assessment of system reliability modeled by dynamic fault trees

Margaux Duroeulx (1, 2) , Nicolae Brinzei (1) , Marie Duflot (3, 2) , Stephan Merz (2)

1 CRAN - Centre de Recherche en Automatique de Nancy
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
3 MOSEL - Proof-oriented development of computer-based systems

Fault trees (FTs) and their extensions are diagrammatic formalisms that are commonly used for reliability assessment and that represent the structure function of systems. The structure function determines tie sets and cut sets, and minimal tie sets are instrumental for assessing systems reliability. In a previous paper, we used satisfiability (SAT) techniques to compute tie sets from the structure function. In this paper we define minimal tie sets with sequences (MTSSs) as an extension of minimal tie sets for analyzing dynamic fault trees (DFTs), and we extend our previous techniques for computing MTSSs. We illustrate our approach using a standard case study and assess its performance over several industrial-size benchmarks.

Mots clés: structure function; tie sets with sequences; reliability; satisfiability; dynamic fault trees; tie sets

Domaines: Automatique; Logique en informatique [cs.LO]

Margaux Duroeulx, Nicolae Brinzei, Marie Duflot, Stephan Merz. Integrating satisfiability solving in the assessment of system reliability modeled by dynamic fault trees. 29th European Safety and Reliability Conference, ESREL 2019, Sep 2019, Hannover, Germany. ⟨10.3850/981-973-0000-00-0⟩. ⟨hal-02262205⟩