Complete Temporal Rules for Cut Sequence Generation in Dynamic Fault Tree Analysis

A large attention has been focused on the dynamic fault tree (DFT). Cut sequence is an algebraic approach to overcome the shortcomings of the traditional methods for DFT analysis. In the generation of cut sequences, temporal rules play a key role, and the complete temporal laws ensure any form of the DFT can be reduced to cut sequences. Recently, lots of temporal rules have been put forward, but none of them are proven to be complete. This paper provides concise, but complete temporal rules. At first, the algebraic framework for temporal rules was built. Secondly, we put forward seven temporal rules, which are proven to be valid. Then, binary-tree-based completeness validations for temporal rules were given. Finally, application demonstrates the efficiency of the proposed temporal rules. Complete temporal rules promote the establishment of an intact theoretical foundation for cut sequence approach.