摘要
故障树分析法在实施过程中会遇到计算量大的问题,二元决策图是解决这个问题的一种新途径。故障树转化为二元决策图涉及的一个关键问题就是对基本事件的排序,但是基本事件排序是一个NP问题。为了解决这个问题提出了一个将故障树转化为二元决策图的启发式算法,此算法既避免了基本事件排序这个难题,同时又充分考虑了故障树的具体结构,使得到的二元决策图尽量的简单。
The problem of complexity in calculation presents to fault tree analysis.Binary decision diagram is a new method in solving the problem.The ordering of the basic event is a crucial problem in fault tree being transferred to binary decision diagram,which is an NP problem.A heuristic algorithm of transferring fault tree to binary decision diagram is presented.The ordering of the basic event is avoided in the algorithm.The structure of the fault tree is taken into account in the algorithm in order to ensure the simpleness of binary decision diagram.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第27期69-71,共3页
Computer Engineering and Applications
关键词
故障树
二元决策树
故障树分析
fault tree
binary decision diagram
fauh tree analysis
