基于二元决策图的故障树底事件排序

发布时间：2018-04-01 14:25

  本文选题：故障树分析　切入点：二元决策图　出处：《西安理工大学学报》2016年01期

【摘要】：提出了一种底事件排序的新方法——最小深度子树法。该方法先将结构复杂的故障树化简为一棵简单的树,然后基于各子树的深度、节点数及节点间的位置关系对底事件进行静态排序,并根据排序结果动态构造BDD。最后,通过对航空发动机加速时喘振停车的故障树分析,证明该方法可快速构建BDD,而且构建的BDD产生的冗余节点数目较少。
[Abstract]:In this paper, a new method of bottom event sequencing, the minimum depth subtree method, is proposed, in which the fault tree with complex structure is reduced to a simple tree, and then based on the depth of each subtree. The number of nodes and the relationship between nodes are used to sort the bottom events statically, and the BDD is constructed dynamically according to the sorting results. Finally, the fault tree analysis of aero-engine acceleration surge parking is carried out. It is proved that this method can construct BDD quickly, and the number of redundant nodes generated by the constructed BDD is small.
【作者单位】： 西安理工大学计算机科学与工程学院;西安理工大学自动化与信息工程学院;
【基金】：国家自然科学基金资助项目(61273127,U1334211,U1534208) 高等学校博士学科点专项科研基金资助项目(20116118110008)
【分类号】：V263.6
，

本文编号：1695972