摘要
利用二元决策图(BDD)中的B—割集和节点概率,提出了基于BDD的关联故障树定量分析新算法。推导了故障树顶事件发生概率和绝对失效强度算法公式,将故障树顶事件发生概率和绝对失效强度计算结合起来,避免了复杂的最小割集和不交化求解过程,显著地减少了布尔代数运算量,给出了算法递归步骤。大量的实例分析验证了此算法的工程实用性。
By the B-cut sets and the probabilities of the nodes of Binary Decision Diagrams(BDD),a new quantitative analysis algorithm of coherent fault tree based on BDD is presented in this paper.The formula of the top event probability and unconditional failure intensity of coherent fault tree is derived.The complicated minimal cut sets and the disjoint process solving are avoided by the combination of top event probability and unconditional failure intensity calculations of the fault tree,and the Boolean algebra computation is reduced obviously.The recursion process of the algorithm is given.The engineering practicability of the new algorithm is proven by many examples.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第10期62-63,158,共3页
Computer Engineering and Applications
基金
西北工业大学研究生创业种子基金资助(编号:Z20040002)
关键词
二元决策图
关联故障树
顶事件发生概率
绝对失效强度
最小割集
Binary Decision Diagrams(BDD),coherent Fault tree,top event probability,unconditional failure intensity,minimal cut sets
