Abstract
This paper proposes, under a rare-event assumption, a new ``Coverage Monte Carlo'' method for evaluating the top-event probability of a coherent fault tree. All the min cuts are assumed to be known. A Karp-Luby Monte Carlo (KLM) estimator with minimum variance is derived in a different manner. The KLM evaluates an inclusion-exclusion formula excluding the first sum of products. A new coverage Monte Carlo (NCM) estimator evaluates the formula excluding the first and the second sums of products. The NCM yields an estimator with a smaller variance than the KLM which becomes a linear time procedure in the number of min cuts. Upper bounds on the numbers of trials necessary to attain a given coefficient of variation are derived for KLM and NCM. The bounds can be calculated before any Monte Carlo trials. The KLM requires at least 8 times more trials than the NCM. Given sufficient computer memory to implement an alias sampling method, the NCM requires less computation time than the KLM when an accurate estimate is required. The NCM is more favorable when the deterministic bounding practice based on the first and second sums of products yields a smaller relative error. The NCM is consistent with the fact that deterministic bounds have been computed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
