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 topdown approach and the iteration approach, thereby reducing the computation time of the Monte Carlo method. | A top-down iteration algorithm for Monte Carlo method for probability estimation of a fault tree with circular logic
