| 一种故障树向BDD的转化方法 |
| |
| 引用本文： | 段珊,张修如,刘树锟,王金娟.一种故障树向BDD的转化方法[J].计算机工程与应用,2009,45(21):51-54. |
| |
| 作者姓名： | 段珊 张修如 刘树锟 王金娟 |
| |
| 作者单位： | 1.湖南涉外经济学院 计算机学部，长沙 410013 2.中南大学 信息科学与工程学院，长沙 410083 |
| |
| 摘 要： | 针对故障树分析的关键技术—排序和置换，提出一种基于BDD的快速有效的（LNPC）方法。该方法采用制定的排序和置换策略直接完成子事件的排序与门事件的置换，一次性完成故障树到BDD的转化和优化，增加了获取最小规模BDD的排序机会，同时降低了BDD的存储空间且不需要先写出故障树的布尔函数。算法分析与实验结果表明该方法对不同的故障树转化是有效的。
|
| 关 键 词： | 故障树 二元决策树 排序 置换 |
| 收稿时间： | 2008-10-10 |
| 修稿时间： | 2009-1-4
|
Transformation method of fault tree based on BDD |
| |
| DUAN Shan,ZHANG Xiu-ru,LIU Shu-kun,WANG Jin-juan.Transformation method of fault tree based on BDD[J].Computer Engineering and Applications,2009,45(21):51-54. |
| |
| Authors: | DUAN Shan ZHANG Xiu-ru LIU Shu-kun WANG Jin-juan |
| |
| Affiliation: | 1.College of Computer Science and Technology，Hunan International Economics University，Changsha 410013，China 2.School of Information Science and Engineering，Central South University，Changsha 410083，China |
| |
| Abstract: | Aiming at the key technology of fault tree analysis,sort and replacement.An effective method,LNPC is provided.This method uses the sort and the replacement strategy to complete the replacement of incident and the sort,and transform the fault tree to BDD.This method can enhance the chance of obtaining smallest size of the BDD,and reduce the storage space of BDD while the fault tree Boolean function doesn't need to write in advance.The analysis and experimental results show that this method is effective to de... |
| |
| Keywords: | fault tree Binary Decision Diagram(BDD) sort replacement |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
