Coupling decomposition and truncation for the analysis of complex fault trees
Authors:
- 15 June 2011
- journal article
- Published by SAGE Publications in Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability
- Vol. 226 (3) , 249-261
Abstract
The analysis of large and complex fault trees is a very difficult task. The main limiting factor is an insufficient working memory. Several methods are available in literature to reduce the working memory requirement including modularization, the so-called ‘re-writing rules’, and truncation, i.e. the use of logic and/or probabilistic cut-offs to determine only the most important system failure modes. The truncation method is very effective, as it allows significant reductions in the computational effort; however, it implies the estimation of the truncation error, a problem not yet solved satisfactorily. Recently, a new method based on the decomposition of a complex fault tree into a set of mutually exclusive simpler fault trees was proposed. The decomposition is repeatedly applied until the generated trees are sufficiently simple to be exactly analysed with the available working memory. Theoretically, this approach would allow the exact analysis of fault trees of any complexity, but the related computation times are generally too high. The scope of this paper is to show how the combined application of decomposition and truncation constitutes a valuable method to analyse complex fault trees. The upper and lower bounds of the top-event probability, obtained by applying this method, are very close to the exact value and their difference depends on the dimension of the available working memory. Furthermore, the probabilistic quantification, including the importance measures of basic events, can easily be performed by properly combining the results from the independent analysis of all simpler fault trees. The developed methodology has been implemented in a software tool and successfully applied to the analysis of several complex fault trees, some of which are considered in this paper.Keywords
This publication has 12 references indexed in Scilit:
- Analysis of large fault trees based on functional decompositionReliability Engineering & System Safety, 2011
- Hybrid approach for the assessment of PSA models by means of binary decision diagramsReliability Engineering & System Safety, 2010
- Development of measures to estimate truncation error in fault tree analysisReliability Engineering & System Safety, 2005
- Truncation Error Evaluation Method for Minimal Cut Set-Based Fault Tree AnalysisJournal of Nuclear Science and Technology, 2005
- A fast BDD algorithm for large coherent fault trees analysisReliability Engineering & System Safety, 2004
- Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within AraliaReliability Engineering & System Safety, 1997
- MetaPrime: an interactive fault-tree analyzerIEEE Transactions on Reliability, 1994
- New algorithms for fault trees analysisReliability Engineering & System Safety, 1993
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Binary Decision DiagramsIEEE Transactions on Computers, 1978