By Topic

An Efficient Algorithm for Reducing the Complexity of Computation in Fault Tree Analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nagy. N. Bengiamin ; Dept. of Systems Engg. Carleton University Ottawa, Ontario ; B. Archie Bowen ; Kurt F. Schenk

This paper presents a new algorithm for efficiently generating the minimal cut-sets of a fault tree containing repetitions of basic events. The algorithm is easily performed by hand and substantially reduces both execution time and storage requirements, over the classical technique, when programmed. The savings are accomplished by recognizing and recursively reducing the influence of the repetitive events. The theoretical basis of the algorithm is presented and examples from the recent literature, used to demonstrate its efficiency. Finally, the computational complexity is discussed and rules presented for simplifying the tree before the computations begin.

Published in:

IEEE Transactions on Nuclear Science  (Volume:23 ,  Issue: 5 )