A method of Disjoint Cut Sets/Sequences generation based on Boolean Algebraic Models for DFTs

For the Boolean Algebraic Models of Dynamic Fault Trees, a method of generating their Disjoint Cut Sets/Sequences is proposed in this paper. This paper is arranged as follows: (1) history and state of the art about Dynamic Fault Tree Analysis (DFTA) are introduced with the list of advantages and disadvantages of the study on DFTA; (2) the basic dynamic events/sequences are analyzed to generate formulae due to the logical operation of negation; (3) the typical dynamic gates including CSP, WSP and HSP are analyzed to deduce the Boolean Algebraic formulae due to the logical operation of negation and De Morgan's laws; (4) by the foregoing tools of disjoint, the inclusion-exclusion formulae of a two-WSP system sharing one spare are deduced based on the acquisition of Minimal Cut Sequences/Sets. The advantage of the proposed method is concluded by comparison with the conventional methods.