用递归BDD(二元决策图)技术分析因果图  

An Analysis of Causality Diagram by Recursive BDD

作　　者：严晓[1] 王洪春[1] 

机构地区：[1]重庆师范大学数学学院,重庆401331

出　　处：《重庆工商大学学报（自然科学版）》2015年第8期34-37,共4页Journal of Chongqing Technology and Business University:Natural Science Edition

基　　金：国家社科基金资助(13BTJ008)

摘　　要：故障树是以系统最不希望发生的顶事件为目标,通过分析找出导致顶上事件发生的全部因素;在故障树分析中,二元决策图(简称BDD)是最有效的方法之一,由于故障树和因果图都是用图形表示因果关系,两者具有很多相似性,而BDD在故障树中有广泛的应用;通过研究表明:在一定条件下,故障树和因果图之间可以互相转化,因此可以分析BDD的原理,并将BDD技术用来分析因果图。Aimed at the most unwilling top event of system, fault tree finds out the all factors that cause thetop event through analysis. In fault tree analysis, two binary decision diagrams （BDD） is the most efficient method.As both fault tree and causality diagram can express causation by digraph, there are lots of similarity in common.However, BDDis widely used in Fault tree. The research shows that under certain conditions, fault tree andcausality diagram can be transformed into each other. Therefore, causality diagram can be analyzed by BDD on thebasis of BDD principle.

关 键 词：故障树 因果图 

分 类 号：O141.41[理学—数学]