By Topic

Evaluating fault trees (AND and OR gates only) with repeated events

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
$31 $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

1 Author(s)

It is pointed out that a common practice in the evaluation of large fault trees is to truncate the computation by neglecting high-order or low-probability cutsets. A major disadvantage of most simple truncation methods, however, is that their accuracy is indeterminate because they do not establish rigorous bounds on the combined probability of the neglected cutsets. A truncated with residuals algorithm is presented. It uses probability-based truncation and determines a rigorous upper bound on each event-probability by propagating the effect of all the truncated cutsets in the form of numeric residuals. The method applies only to fault trees constructed entirely of AND and OR gates and allows unrestricted use of repeated events

Published in:

Reliability, IEEE Transactions on  (Volume:39 ,  Issue: 2 )