| 故障树转化为二元决策树的算法研究 |
| |
| 引用本文： | 郎荣玲.故障树转化为二元决策树的算法研究[J].计算机工程与应用,2008,44(27):69-71. |
| |
| 作者姓名： | 郎荣玲 |
| |
| 作者单位： | 北京航空航天大学,电子信息工程学院,北京,100083 |
| |
| 摘 要： | 故障树分析法在实施过程中会遇到计算量大的问题,二元决策图是解决这个问题的一种新途径。故障树转化为二元决策图涉及的一个关键问题就是对基本事件的排序,但是基本事件排序是一个NP问题。为了解决这个问题提出了一个将故障树转化为二元决策图的启发式算法,此算法既避免了基本事件排序这个难题,同时又充分考虑了故障树的具体结构,使得到的二元决策图尽量的简单。
|
| 关 键 词： | 故障树 二元决策树 故障树分析 |
| 收稿时间： | 2007-11-15 |
| 修稿时间： | 2008-4-3
|
Research on fault tree conversion to binary decision diagram |
| |
| LANG Rong-ling.Research on fault tree conversion to binary decision diagram[J].Computer Engineering and Applications,2008,44(27):69-71. |
| |
| Authors: | LANG Rong-ling |
| |
| Affiliation: | School of Electronic and Information Engineering，Beihang University，Beijing 100083，China |
| |
| Abstract: | 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. |
| |
| Keywords: | fault tree binary decision diagram fault tree analysis |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
