Referenced Items are not available for this document.
Evaluation of the cut sets of large s-coherent and non-coherent fault trees presents a severe computational problem. The computer program, AFTP has been used to evaluate the important minimal cut and path sets of large fault trees containing many hundreds of gates. The computational advantages of a Boolean algebra, bottom-up approach are emphasised.
Published in:
Reliability, IEEE Transactions on
(Volume:R-33
,
Issue:
2
)
Date of Publication: June 1984
- Page(s):
- 171
- ISSN :
- 0018-9529
- Digital Object Identifier :
- 10.1109/TR.1984.5221767
- Date of Current Version :
- 25 August 2009
- Issue Date :
- June 1984
- Sponsored by :
- IEEE Reliability Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
