期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A Simple Method to Derive Minimal Cut Sets for a Non-coherent Fault Tree 被引量:2
1
作者 takehisa kohda 《International Journal of Automation and computing》 EI 2006年第2期151-156,共6页
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 ... 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. 展开更多
关键词 Non-coherent fault trees monotonic sub-trees minimal cut sets.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部