Abstract
Methods available for fault tree analysis, based on obtaining minimal cut sets and their advantages, are briefly discussed. An algorithm which makes use of structure optimization, restricted pivotal decomposition for repeated events and modularization techniques is presented. If necessary, modules are broken down into cut sets employing an efficient top-down algorithm provided with a quantitative cut-off procedure, and a selective development sequence of gates. This evaluation scheme has been implemented in the computer code TREEMOD, a part of the program system RISA, capable of computing the dominant cut sets of very large and interconnected fault trees.
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.
