用递归BDD技术分析故障树  

Analyzing Fault Tree by Using Method of Recursive BDD Technique

作　　者：罗航[1] 王厚军[2] 黄建国[2] 龙兵[2] 

机构地区：[1]四川大学测量控制系成都610065 [2]电子科技大学自动化工程学院成都611731

出　　处：《电子科技大学学报》2011年第5期726-731,共6页Journal of University of Electronic Science and Technology of China

基　　金：部级基础科研项目,部级预研基金

摘　　要：研究了二元决策图(BDD)技术在故障树分析中的具体运用。针对传统故障树分析方法只能得到顶事件的割集而常规不交化割集策略又太过烦琐的弊端,以同时实现故障树顶事件的结构函数及其不交化割集的形式为要求,分析了BDD技术的原理和方法。在用递归方法实现顶事件BDD的基础上,提出了用继承技术自动实现不交化割集。在具体的例证中验证了BDD技术优于传统故障树分析的原因。In this paper, the practical application of BDD （Binary Decision Diagram, BDD） technique in fault tree analysis is studied. Because there are some disadvantages that the fault tree analysis with traditional method could only get cut-sets of top event, and normal non-intersection strategy was too cumbersome, the principles and method of BDD technique are analyzed. On the basis of researching BDD structure of top-event with recursive technique, a key technique, i.e., inherit technique, is put forward and used to form non-intersection cut-sets. Finally, an example is given to interpret the reasons why the BDD technique is superior to method of traditional fault tree analysis.

关 键 词：二元决策图 故障树 继承 不交化割集:递归 

分 类 号：TP202.1[自动化与计算机技术—检测技术与自动化装置]