Fault tree analysis using disjoint disjunctive forms
Hisaaki Tajima, Toshiyuki Iida · Electronics and Communications in Japan (Part III Fundamental Electronic Science) · 1992
Abstract In fault tree analysis (FTA) using minimal cut sets, the analysis time increases exponentially with fault tree size, thus analyzing a large fault tree is tedious. This paper proposes some algorithms to efficiently calculate the failure rate and structural importance of fault trees. Each fault tree is decomposed into subtrees, whose disjoint disjunctive forms are derived. The failure rate of the top event can be calculated with these disjoint disjunctive forms. Some examples confirm the efficiency of these algorithms.