计算机工程与应用2009，Vol.45Issue(21)：51-54,4.DOI:10.3778/j.issn.1002-8331.2009.21.013
一种故障树向BDD的转化方法
Transformation method of fault tree based on BDD
段珊 1张修如 2刘树锟 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的转化方法[J].计算机工程与应用,2009,45(21):51-54,4.
