Abstract
This paper examines the question of the generation of loops in the construction of fault trees (FTs) starting from the printouts of a hazard operability studies (HazOp) analysis. Some examples of the formation of a loop are presented and the rules for its elimination are illustrated. The easiest way is to apply simple syntax rules in the graphic construction of a FT. This, however, presupposes prior recognition by the analyst of the initiation of a loop. The safest way, therefore, is to eliminate the problem at its root by deriving the FT straight from the modules of a well-structured HazOp procedure, such as recursive operability analysis.
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.
