西安理工大学学报2016，Vol.32Issue(1)：23-29,7.DOI:10.19322/j.cnki.issn.1006-4710.2016.01.005
基于二元决策图的故障树底事件排序
Variable ordering in fault tree analysis based on binary decision diagrams
摘要
Abstract
In this paper,a novel ordering method,namely the minimum depth of the sub-tree method,is proposed.This method reduces a complex fault tree to be a simple tree,and then makes static variable ordering based on the sub-tree's depth,node numbers and the positional re-lationship between the nodes,and finally dynamically construct a BDD according to the sorting result.In the end,the aviation engine acceleration surge parking fault tree shows that this meth-od can quickly build a BDD,and the BDD has less redundant nodes.关键词
故障树分析/二元决策图/底事件排序Key words
fault tree analysis (FTA )/binary decision diagram (BDD)/variable ordering heuristics分类
信息技术与安全科学引用本文复制引用
黑新宏,张阳阳,钱富才,谢国,何文娟..基于二元决策图的故障树底事件排序[J].西安理工大学学报,2016,32(1):23-29,7.基金项目
国家自然科学基金资助项目(61273127,U1334211,U1534208) （61273127,U1334211,U1534208）
高等学校博士学科点专项科研基金资助项目(20116118110008) （20116118110008）
