Cart (Loading....) | Create Account
Close category search window
 

An Efficient Bottom-up Algorithm for Enumerating Minimal Cut Sets 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

2 Author(s)
Nakashima, K. ; Department of Electronics; Himeji Institute of Technology; 2167, Shosha, Himeji-shi; Himeji, 671-22 JAPAN. ; Hattori, Yoshio

The paper improves the conventional bottom-up algorithm for enumerating minimal cut sets of fault tree. It is proved that, when the logical product of two reduced sum-of-product forms is expanded by the distribution rule, one need only check if each resulting term is absorbed by some terms of two original sum-of-product forms. The algorithm for executing this process is presented and illustrated by an example. The entire computer program is given in a supplement and the computational results for several examples are presented to demonstrate the efficiency of the algorithm.

Published in:

Reliability, IEEE Transactions on  (Volume:R-28 ,  Issue: 5 )

Date of Publication:

Dec. 1979

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.