A simple method to derive minimal cut sets for a non-coherent fault tree |
| |
Authors: | Takehisa Kohda |
| |
Affiliation: | (1) Department of Aeronautics and Astronautics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan |
| |
Abstract: | Minimal cut sets (or prime implicants: minimal combinations of basic event conditions leading to system failure) are important information for reliability/safety analysis and design. To obtain minimal cut sets for general non-coherent fault trees, including negative basic events or multi-valued basic events, a special procedure such as the consensus rule must be applied to the results obtained by logical operations for coherent fault trees, which will require more steps and time. This paper proposes a simple method for a non-coherent fault tree, whose top event is represented as an AND combination of monotonic sub-trees. A "monotonic" sub-tree means that it does not have both positive and negative representations for each basic event. It is proven that minimal cut sets can be obtained by a conventional method for coherent fault trees. An illustrative example of a simple event tree analysis shows the detail and characteristics of the proposed method. |
| |
Keywords: | Non-coherent fault trees monotonic sub-trees minimal cut sets |
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录! |
| 点击此处可从《国际自动化与计算杂志》浏览原始摘要信息 |
|
点击此处可从《国际自动化与计算杂志》下载全文 |
|