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

Algorithm Analysis of Gate Importance-Measures in A FT

把失效树中基本事件级的重要度推广到门事件级的重要度,分析了怎样用通常的失效树算法计算门重要度,给出了计算门可靠性重要度的计算公式。并通过例子来比较改进前后的算法,说明该算法的简单实用和精确性,及其易于在计算机上实现。

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.