失效树中门重要度的算法分析 |
| |
引用本文: | 赵继春,沈元隆.失效树中门重要度的算法分析[J].南京邮电大学学报(自然科学版),2003,23(3):57-60. |
| |
作者姓名: | 赵继春 沈元隆 |
| |
作者单位: | 南京邮电学院,电子工程系,江苏,南京,210003 |
| |
摘 要: | 把失效树中基本事件级的重要度推广到门事件级的重要度,分析了怎样用通常的失效树算法计算门重要度,给出了计算门可靠性重要度的计算公式。并通过例子来比较改进前后的算法,说明该算法的简单实用和精确性,及其易于在计算机上实现。
|
关 键 词: | 失效树 门事件 重要度 算法 |
文章编号: | 1000-1972(2003)03-0057-04 |
修稿时间: | 2002年12月26 |
Algorithm Analysis of Gate Importance-Measures in A FT |
| |
Abstract: | 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. |
| |
Keywords: | Fault tree Gate event Importance Algorithm |
本文献已被 CNKI 万方数据 等数据库收录! |
|