一种基于ZBDD求解大型故障树的基本事件排序方法  

An ordering scheme of the basic events based on zero-suppressed binary decision diagrams for the large-scale fault tree analysis

作　　者：刘萍[1] 吴宜灿[1] 李亚洲[1] 王海涛[1] 胡丽琴[1] 张士杰[1] 麻晓敏[1] 聂淼[1] 袁润[1] 

机构地区：[1]中国科学院等离子体物理研究所,安徽合肥230031

出　　处：《核科学与工程》2007年第3期282-288,共7页Nuclear Science and Engineering

基　　金：中科院合肥物质科学研究院院长基金的支持.

摘　　要：如何提高大型故障树分析效率一直是研究人员致力于的一个热点问题。近年提出的基于ZBDD的分析方法是一种比较有效的大型故障树求解方法。本文从ZBDD结构和将故障树转换成ZBDD的特点入手,分析了基本事件的排序对ZBDD结构的影响,并结合BDD基本事件排序的当前研究成果,设计了一种基于ZBDD求解大型故障树基本事件的排序方法,并经过反复测试和比较分析,证明了这个方法的有效性。How to improve the analysis efficiency of the large-scale fault trees attracts lots of attention of the research community. An efficient method called Zero-suppressed Binary Decision Diagram was presented for the large-scale fault tree analysis nowadays. In this paper the influence of the basic events ordering on the scale of ZBDD structure is evaluated. An ordering scheme for the ordering of the basic events in ZBDD, which utilizes the characters of ZBDD structure and the conversion from the fault tree to ZBDD, is also proposed based on the recent progress of the BDD ordering scheme research. The application of this ordering scheme for many practical fault trees demonstrates that it is efficient.

关 键 词：零压缩二元决策图 概率截断 排序方法 最小割集 

分 类 号：TL61[核科学技术—核技术及应用]