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.展开更多
A new fault tree analysis (FTA) computation method is put forth by using modularization technique in FTA with cut sets matrix, and can reduce NP (Nondeterministic polynomial) difficulty effectively. This software can ...A new fault tree analysis (FTA) computation method is put forth by using modularization technique in FTA with cut sets matrix, and can reduce NP (Nondeterministic polynomial) difficulty effectively. This software can run in IBM PC and DOS 3.0 and up. The method provides theoretical basis and computation tool for application of FTA technique in the common engineering system展开更多
On the base of study of the correlation of fault tree's main data-minimum cutsets, minimum path sets, non-intersect minimum cut sets and non-intersect minimum path sets,transformation method among main data are fo...On the base of study of the correlation of fault tree's main data-minimum cutsets, minimum path sets, non-intersect minimum cut sets and non-intersect minimum path sets,transformation method among main data are found, i.e. the transformation can be realized by theoperation of cut sets matrixes. This method provides anew way to reduce 'NP' difficulty and simplifyFTA.展开更多
文摘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.
文摘A new fault tree analysis (FTA) computation method is put forth by using modularization technique in FTA with cut sets matrix, and can reduce NP (Nondeterministic polynomial) difficulty effectively. This software can run in IBM PC and DOS 3.0 and up. The method provides theoretical basis and computation tool for application of FTA technique in the common engineering system
文摘On the base of study of the correlation of fault tree's main data-minimum cutsets, minimum path sets, non-intersect minimum cut sets and non-intersect minimum path sets,transformation method among main data are found, i.e. the transformation can be realized by theoperation of cut sets matrixes. This method provides anew way to reduce 'NP' difficulty and simplifyFTA.
