Abstract
This paper describes an efficient technique for computerized fault-tree analysis. The technique is based upon binary coding of events and bit manipulation for tree reduction, reducing both computation time and computer storage requirements. The operations include generation of minimal cut sets for trees containing arbitrary AND and OR logic, and determination of top event existence probability for s-independent minimal cut sets composed of s-independent basic events. By the use of an upward algorithm for tree reduction, information is available at each logic gate. The effectiveness in producing minimal cut sets and top event probability has been demonstrated through analysis of fault trees of various sizes. The current implementation accommodates trees containing AND and OR gates, including all logical redundancies.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
