基于有序二元决策图的动态故障树定性分析方法  

Qualitative Analysis of Dynamic Fault Tree Based on Sequential BinaryDecision Diagram

作　　者：高迎平[1] 李洋[1] 田楷 

机构地区：[1]河北工业大学,天津300401

出　　处：《计算机与数字工程》2016年第12期2342-2347,共6页Computer & Digital Engineering

摘　　要：关于基于有序二元决策图的定性分析方法,首先引入时序逻辑,将动态门转换成时序逻辑表达式,然后将动态故障树转换成相应的有序二元决策图结构。动态故障树转换方法面临底部事件排序、冗余结构等问题,影响了定性分析的效果,为此,提出了基于成分组合法的逆向转换法,该方法具有直接、高效等特点。实例验证表明该方法能够减少转化后有序二元决策图的节点数量和冗余结构,提高动态故障树定性分析的效率和效果。The qualitative analysis based on sequential binary decision diagram was discussed. B y introducing temporal logic,the dynamic gate was firstly converted into a temporal logic algebraic expression,and then the dynamic fault tree was converted into the corresponding sequential binary decision diagram. However, traditional conversion methods suffer fromsome problem such as the sort of the bottom event and generation of invalid nodes. Therefore a new reverse conversion meth-od based on component combination is proposed. This method has the characteristics of direct and high efficiency. To certify merits of the proposed method , an example is provided. The result indicates themethod proposed can reduce the number of nodes and redundant structure of the sequential binary decision diagram,and it can improve the efficiency and effectiveness of dynamic fault tree qualitative analysis.

关 键 词：动态故障树 有序二元决策图 时序逻辑 逆向转换法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]