失效树中门重要度的算法分析  

Algorithm Analysis of Gate Importance-Measures in A FT

作　　者：赵继春[1] 沈元隆[1] 

机构地区：[1]南京邮电学院电子工程系,江苏南京210003

出　　处：《南京邮电学院学报（自然科学版）》2003年第3期57-60,69,共5页Journal of Nanjing University of Posts and Telecommunications

摘　　要：把失效树中基本事件级的重要度推广到门事件级的重要度,分析了怎样用通常的失效树算法计算门重要度,给出了计算门可靠性重要度的计算公式。并通过例子来比较改进前后的算法,说明该算法的简单实用和精确性,及其易于在计算机上实现。This paper extends the Birnbaum importance measure for a basic event level to a gate event level in a fault tree when gate events are reciprocally statistical dependent. An explicit formula is given for gate reliability importance,which shows how to compute it by using a conventional fault tree algorithm. An example shows that new algorithm is intuitive and veracity, and can be easily achieved on computer through comparing two types of algorithms.

关 键 词：失效树 重要度 门事件 算法 可靠性 

分 类 号：TB114.3[理学—概率论与数理统计]