Fuzzy Fault Trees: the Fast and the Formal
Thi Kim Nhung Dang, Benedikt Peterseim, Milan Lopuhaä-Zwakenberg, Mariëlle Stoelinga
TL;DR
The paper addresses uncertainty in fault-tree analysis by introducing fuzzy fault trees, where basic-event probabilities are fuzzy numbers and the system unreliability is defined via the Zadeh extension. The core method uses alpha-cut representations and leverages fault-tree coherence to produce a fast bottom-up algorithm for tree-structured FTs and a general result extending any unreliability algorithm to fuzzy DAGs under regular fuzzy numbers. The authors prove and rely on a key DAG extension theorem and validate their approach with empirical studies using the Storm model checker. The work provides a principled, scalable framework for simultaneous reliability assessment and uncertainty quantification in safety-critical systems.
Abstract
We provide a rigorous framework for handling uncertainty in quantitative fault tree analysis based on fuzzy theory. We show that any algorithm for fault tree unreliability analysis can be adapted to this framework in a fully general and computationally efficient manner. This result crucially leverages both the alpha-cut representation of fuzzy numbers and the coherence property of fault trees. We evaluate our algorithms on an established benchmark of synthetic fault trees, demonstrating their practical effectiveness.
