求解故障树底事件最优指标顺序的改进算法  

An Improved Algorithm for Choosing the Optimal Ordering of the Basic Events of Fault Tree

作　　者：张超[1] 马存宝[1] 胡云兰 许家栋[1] 

机构地区：[1]西北工业大学,西安710072 [2]中船重工集团第705研究所,西安710075

出　　处：《弹箭与制导学报》2005年第S2期370-372,共3页Journal of Projectiles,Rockets,Missiles and Guidance

基　　金：西北工业大学研究生创业种子基金(Z20040002)

摘　　要：底事件指标顺序在基于二元决策图(BDD)的故障树分析过程中影响很大。基于故障树的结构重要度,本文提出了一种求解故障树底事件指标顺序的改进算法,所得到的底事件最优指标顺序不受故障树画法的影响,算法稳健且能使计算量减少一半。The ordering of the basic events is critical to the analysis of fault tree based on Binary Decision Diagram (BDD).Based on the structural importance of fault tree,a refined algorithm for choosing the ordering of the basic e- vents of a fault tree is presented in this paper.The optimal ordering of the basic events obtained is independent with the drawing of a fault tree,the algorithm is robust and the calculation workload is doubly reduced.

关 键 词：二元决策图 故障树 结构重要度 最优指标顺序 

分 类 号：TJ760[兵器科学与技术—武器系统与运用工程]