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 consecutive k out of n: F System, with n linearly arranged i. i. d. components, is examined. This paper gives an exact formula for computing the system's reliability directly. Complexity of this algorithm is...A consecutive k out of n: F System, with n linearly arranged i. i. d. components, is examined. This paper gives an exact formula for computing the system's reliability directly. Complexity of this algorithm is an O(n k). Further more, the system's reliability can be computed more quickly and more effectively from this formula than those previously given.展开更多
In the traditional method for the reliability analysis of fault-tolerant system,the system structure is described by means of binary decision diagram (BDD) and Markov process,and then the reliability indexes are calcu...In the traditional method for the reliability analysis of fault-tolerant system,the system structure is described by means of binary decision diagram (BDD) and Markov process,and then the reliability indexes are calculated.However,as the size of system augments,the size of state space will increase exponentially.Additionally,Markov approach requires that the failure and repair time of the components obey an exponential distribution.In this study,by combining dynamic fault tree (DFT) and numerical simulation based on the minimal sequence cut set (MSCS),a new method to evaluate reliability of fault-tolerant system with repairable components is proposed.The method presented does not depend on Markov model,so that it can effectively solve the problem of the state-space combination explosion.Moreover,it is suitable for systems whose failure and repair time obey an arbitrary distribution.Therefore,our method is more flexible than the traditional method.At last,an example is given to verify the method.展开更多
文摘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 consecutive k out of n: F System, with n linearly arranged i. i. d. components, is examined. This paper gives an exact formula for computing the system's reliability directly. Complexity of this algorithm is an O(n k). Further more, the system's reliability can be computed more quickly and more effectively from this formula than those previously given.
文摘In the traditional method for the reliability analysis of fault-tolerant system,the system structure is described by means of binary decision diagram (BDD) and Markov process,and then the reliability indexes are calculated.However,as the size of system augments,the size of state space will increase exponentially.Additionally,Markov approach requires that the failure and repair time of the components obey an exponential distribution.In this study,by combining dynamic fault tree (DFT) and numerical simulation based on the minimal sequence cut set (MSCS),a new method to evaluate reliability of fault-tolerant system with repairable components is proposed.The method presented does not depend on Markov model,so that it can effectively solve the problem of the state-space combination explosion.Moreover,it is suitable for systems whose failure and repair time obey an arbitrary distribution.Therefore,our method is more flexible than the traditional method.At last,an example is given to verify the method.
