I. Ciarambino, S. Contini, M. Demichela, N. Piccinini
{"title":"How to avoid the generation of loops in the construction of fault trees","authors":"I. Ciarambino, S. Contini, M. Demichela, N. Piccinini","doi":"10.1109/RAMS.2002.981638","DOIUrl":null,"url":null,"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.","PeriodicalId":395613,"journal":{"name":"Annual Reliability and Maintainability Symposium. 2002 Proceedings (Cat. No.02CH37318)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Reliability and Maintainability Symposium. 2002 Proceedings (Cat. No.02CH37318)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAMS.2002.981638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
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.