一种用于多故障诊断的改进二元决策图算法  

Enhanced BDD algorithm for multiple-fault diagnosis

作　　者：袁侃[1] 胡寿松[1] 

机构地区：[1]南京航空航天大学自动化学院,南京210016

出　　处：《控制与决策》2010年第7期1117-1120,共4页Control and Decision

基　　金：国家自然科学基金重点项目(60234010);航空科学基金(05E52031)

摘　　要：在将故障树转化为二元决策图(BDD)的构件连接法规则中,加入了两项新的规则以保证最终的合成BDD具有唯一的结构.通过比较具有相同结构重要度的割集概率,从而确定需要检测故障源的排序.该方法可用于对具有独立底事件的数字系统进行多故障诊断.由于无需确定底事件顺序和最小割集,该方法比传统故障树诊断方法具有更高的效率,并且更适合于在计算机上实现.To ensure the unique structure of the final integrated binary decision diagram（BDD）,two new rules are added to the connection rules of component connection approach for fault tree conversion to BDD. Through comparing the probabilities of cut sets with the same structure importance,the ordering of checking the fault source is determined. This method can be applied to multiple-fault diagnosis for digital systems with independent basic events. Because this method has no need to determine the sequence of basic events and the minimal cut sets,it＇s more suitable for computer execution and has higher efficiency than traditional methods of fault tree diagnosis.

关 键 词：二元决策图 故障树 哈夫曼码 多故障诊断 

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