How to avoid the generation of loops in the construction of fault trees

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.
如何避免在构造故障树时产生环路
本文从危害可操作性研究(HazOp)分析的打印输出出发,研究了故障树(FTs)构造中环路的生成问题。给出了一些形成环路的例子,并说明了消除环路的规则。最简单的方法是在FT的图形构造中应用简单的语法规则。然而,这需要分析人员事先识别出循环的起始。因此,最安全的方法是直接从结构良好的HazOp程序(如递归可操作性分析)的模块中推导出FT,从而从根本上消除问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信