Find in Library
Search millions of books, articles, and more
Indexed Open Access Databases
A top-down iteration algorithm for Monte Carlo method for probability estimation of a fault tree with circular logic
oleh: Sang Hoon Han
| Format: | Article |
|---|---|
| Diterbitkan: | Elsevier 2018-08-01 |
Deskripsi
Calculating minimal cut sets is a typical quantification method used to evaluate the top event probability for a fault tree. If minimal cut sets cannot be calculatedĀ or if the accuracy of the quantification result is in doubt, the Monte Carlo method can provide an alternative for fault tree quantification. The Monte Carlo method for fault tree quantification tends to take a long time because it repeats the calculation for a large number of samples. Herein, proposal is made to improve the quantification algorithm of a fault tree with circular logic. We developed a top-down iteration algorithm that combines the characteristics of the top-down approach and the iteration approach, thereby reducing the computation time of the Monte Carlo method. Keywords: Circular Logic, Fault Tree, FTeMC, Monte Carlo Approach, Top-Down Iteration Approach, Top Event Probability