一种基于逻辑代数模型的动态故障树不交化方法

A Method of Disjoint Cut Sets/Sequences Generation Based on Boolean Algebraic Models for DFTs

针对动态故障树的逻辑代数模型,提出一种不交化方法:在获得最小割序列或集合的基础上,通过对动态逻辑事件进行"非运算"和"反演"运算,推演出故障树逻辑代数模型的容-斥不交化形式,为其后的动态故障树定量分析提供有效的结构函数表达式。借助一个共享备件的双温贮备(WSP)系统案例的研究,可以体现出该种方法较之传统方法的优越性。

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 （DFI＇A） 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 Alge- braic 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 conven- tional methods.