A Fast Recursive Algorithm to Compute the Probability of M-out-of-N events
Abstract
The successful performance of systems (power plants, aircraft, missiles, spacecraft, etc.) while degraded due to either man-made or natural stimuli is currently of interest to the survivability/vulnerability assessment communities. The fault tree model has long been used to qualify and quantify the likelihood of these degraded states. This report details the use of a particular recursive algorithm which is based on the 2-out-of-3 principle for M-out-of-N gates. Software currently available to calculate M-out-of-N gates is usually based on a cut set methodology for quantification. However, when N is too large, the number of cut sets becomes unmanageable. This algorithm provides a technique to calculate an exact probability when N is too large for cut set techniques. Statistical analysis, Fault tree analysis, Fault tolerance, Risk assessment, Recursive algorithm, Computer aided diagnosis, Degradation, Mathematics
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1994
- Accession Number
- ADA283679
Entities
People
- G. E. Radke Jr.
- J. Evanoff