By Topic

On the Analysis of Fault Trees

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)
Bennetts, R.G. ; Department of Electronics//The University//Southampton S09 5NH ENGLAND

The paper is concerned with the analysis of fault trees and describes an algorithm for deriving a reduced Boolean sum-of-product (s-o-p) expression from a description of the structure. The algorithm was developed initially as an analytic procedure for combinational logic networks and employs a reverse Polish notation to describe the structure which is then converted to an equivalent s-o-p expression. This procedure is equally applicable to fault tree analysis but care must be exercised in interpreting the Boolean result as a probability relationship. This aspect is discussed and a simple test and modification procedure described, enabling the original Boolean s-o-p expression to be converted into an equivalent s-o-p expression which can be interpreted directly as a probability relationship.

Published in:

Reliability, IEEE Transactions on  (Volume:R-24 ,  Issue: 3 )