基于二叉决策图的故障树求解法  

A binary decision diagram for fault tree analysis

作　　者：高巍[1] 张琴芳[1] 

机构地区：[1]上海核工程研究设计院,上海200233

出　　处：《核技术》2011年第10期791-795,共5页Nuclear Techniques

摘　　要：探讨了二叉决策图(BDD)求解故障树失效概率和最小割集(MCS)的方法,包括如何将故障树转化为BDD、用BDD求解最小割集、利用零压缩二叉决策图(ZBDD)表示最小割集以减少存储空间、基于BDD求解故障树顶事件失效概率。用程序实现了BDD算法,以某电厂PSA模型部分分枝为对象,通过手工计算和RiskSpectrum PSA程序验证了该程序的正确性,对比结果显示该程序可用于求解小规模故障树失效率和MCS。In this paper, binary decision diagram （BDD） algorithm is used for fault tree analysis. The ways of calculating failure probability and minimal cut-set （MCS） for certain fault trees are presented, including conversion from fault tree to BDD structure, obtaining MCS from BDD, MCS storage in terms of zero-suppressed BDD （ZBDD） for space-saving, and calculation of top event unavailability. A program was compiled and validated by calculating a PSA model of certain nuclear power plant both by hand and RiskSpectrum PSA. The comparison results show that the program can qualify and quantify a fault tree of relatively small scale.

关 键 词：故障树分析 二叉决策图(BDD) 程序实现 

分 类 号：TM623.8[电气工程—电力系统及自动化]