节点文献

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

A binary decision diagram for fault tree analysis

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 高巍张琴芳

【Author】 GAO Wei ZHANG Qinfang(Shanghai Nuclear Engineering Research and Design Institute,Shanghai 200233,China)

【机构】 上海核工程研究设计院

【摘要】 探讨了二叉决策图(BDD)求解故障树失效概率和最小割集(MCS)的方法,包括如何将故障树转化为BDD、用BDD求解最小割集、利用零压缩二叉决策图(ZBDD)表示最小割集以减少存储空间、基于BDD求解故障树顶事件失效概率。用程序实现了BDD算法,以某电厂PSA模型部分分枝为对象,通过手工计算和RiskSpectrum PSA程序验证了该程序的正确性,对比结果显示该程序可用于求解小规模故障树失效率和MCS。

【Abstract】 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.

  • 【分类号】TM623.8
  • 【被引频次】14
  • 【下载频次】172
节点文献中: 

本文链接的文献网络图示:

本文的引文网络