Fault tree reduction and quantification—an overview of IRRAS algorithms

Autor:	Dale M. Rasmuson, Kenneth D. Russell
Rok vydání:	1993
Předmět:	Reduction (complexity) Fault tree analysis Sequence Incremental decision tree Tree (data structure) Cut Reliability (computer networking) Pruning (decision trees) Safety Risk Reliability and Quality Algorithm Industrial and Manufacturing Engineering Mathematics
Zdroj:	Reliability Engineering & System Safety. 40:149-164
ISSN:	0951-8320
DOI:	10.1016/0951-8320(93)90105-8
Popis:	This paper provides a comprehensive overview of the fault tree and accident sequence cut set reduction and quantification algorithms used in the Integrated Reliability and Risk Analysis System (IRRAS). The basic fault tree reduction algorithm is a top-down approach that uses some bottom-up techniques and takes advantage of several optimization methods to restructure and prune the fault tree. These methods include independent sub-trees, probability pruning, and coalescing of gates. The accident sequence algorithm builds a fault tree containing the failed and successful or working systems, and then uses the fault tree cut set algorithm to solve the tree.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::147beabedb796ccaf984eb07979785ce https://doi.org/10.1016/0951-8320(93)90105-8 Zobrazit plný text záznamu