Publication details

Scalable Analysis of Fault Trees with Dynamic Features

Authors

KRČÁL Jan KRČÁL Pavel

Year of publication 2015
Type Article in Proceedings
Conference DSN 2015
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.1109/DSN.2015.29
Field Informatics
Keywords fault trees; dynamic fault trees; BDMP; nuclear safety; probabilistic safety analysis
Description Fault trees constitute one of the essential formalisms for static safety analysis of large industrial systems such as nuclear power plants. Dynamic fault trees (DFT) enrich the formalism by time-dependent behaviour, e.g., repairs or functional dependencies. Analysis of DFT is however so far limited to substantially smaller models than those required by safety regulators for nuclear power plants. We propose a fault tree formalism that combines both static and dynamic features, called SD fault trees. It gives the user the freedom to express each equipment failure either statically, without modelling temporal information, or dynamically, allowing repairs and other timed interdependencies. We introduce a general analysis algorithm for SD fault trees. The algorithm (1) scales similarly to static algorithms when considering an important subclass of this formalism and (2) allows for a more realistic analysis compared to static algorithms as it takes into account the temporal interdependencies in the model. Finally, we demonstrate the applicability of the method by experimental evaluation on realistic fault tree models of nuclear power plants.
Related projects: