Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (21): 51-54.DOI: 10.3778/j.issn.1002-8331.2009.21.013

• 研究、探讨 • Previous Articles     Next Articles

Transformation method of fault tree based on BDD

DUAN Shan1,ZHANG Xiu-ru2,LIU Shu-kun1,WANG Jin-juan1   

  1. 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
  • Received:2008-10-10 Revised:2009-01-04 Online:2009-07-21 Published:2009-07-21
  • Contact: DUAN Shan

一种故障树向BDD的转化方法

段 珊1,张修如2,刘树锟1,王金娟1   

  1. 1.湖南涉外经济学院 计算机学部,长沙 410013
    2.中南大学 信息科学与工程学院,长沙 410083
  • 通讯作者: 段 珊

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 defferent fault tree transform.

Key words: fault tree, Binary Decision Diagram(BDD), sort, replacement

摘要: 针对故障树分析的关键技术—排序和置换,提出一种基于BDD的快速有效的(LNPC)方法。该方法采用制定的排序和置换策略直接完成子事件的排序与门事件的置换,一次性完成故障树到BDD的转化和优化,增加了获取最小规模BDD的排序机会,同时降低了BDD的存储空间且不需要先写出故障树的布尔函数。算法分析与实验结果表明该方法对不同的故障树转化是有效的。

关键词: 故障树, 二元决策树, 排序, 置换