A NEW APPROACH FOR FAULT TREE ANALYSIS
摘要
In this paper the disjoint manipulation rules (DMRs) of Boolean algebra are presented.Using this rules, the disjoint failure function (DFF) of a system can be written directly froma constructed fault-tree (FT), and the system failure probability can be calculated readily.Consequently, a new approach for fault-tree analysis (FTA) is formed.By the new approach, the programs applied to enumerate minimal cut sets (MCSs) orprime implicant sets (PISs) and to transform the system failure function to disjoint formare simplified to a unique program, and the coherent and non-coherent systems can be handledconsistently. The amount of computation is reduced to less than a half.In addition, the techniques of decomposition and reduction for FT are combined withthe new approach. Extending the concept of module, we propose the concept of replicatedmodule of FT and the rules of reduction of the logical redundancy terms. Then the efficiencyof decomposition and reduction is increased, and the amount of computation is furtherdecreased.