描述网络的可靠性框图工具

M. Sahinoglu, C. Ramamoorthy, A.E. Smith, B. Dengiz
{"title":"描述网络的可靠性框图工具","authors":"M. Sahinoglu, C. Ramamoorthy, A.E. Smith, B. Dengiz","doi":"10.1109/RAMS.2004.1285437","DOIUrl":null,"url":null,"abstract":"The proposed tool, using a novel \"compression algorithm\" is capable of reducing any complicated series-parallel system to a visible sequence of series and parallel blocks in a reliability block diagram (RBD) by first finding all existing paths, then algorithmically compressing all redundant component duplications and finally calculating an exact reliability and creating an encoding of the topology. A fast algorithm to perform state enumeration in a hybrid form assisted by the polish encoding approach on complex networks to compute the exact s-t reliability is in progress by the authors. The graphical screening ease and convenience of this algorithm is advantageous for planners and designers trying to improve system reliability by allowing a quick and efficient intervention that may be required at a dispatch center to observe routine operations and/or identify solution alternatives in case of a crisis. Note, s denotes the source and t denotes the target.","PeriodicalId":270494,"journal":{"name":"Annual Symposium Reliability and Maintainability, 2004 - RAMS","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A reliability block diagramming tool to describe networks\",\"authors\":\"M. Sahinoglu, C. Ramamoorthy, A.E. Smith, B. Dengiz\",\"doi\":\"10.1109/RAMS.2004.1285437\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The proposed tool, using a novel \\\"compression algorithm\\\" is capable of reducing any complicated series-parallel system to a visible sequence of series and parallel blocks in a reliability block diagram (RBD) by first finding all existing paths, then algorithmically compressing all redundant component duplications and finally calculating an exact reliability and creating an encoding of the topology. A fast algorithm to perform state enumeration in a hybrid form assisted by the polish encoding approach on complex networks to compute the exact s-t reliability is in progress by the authors. The graphical screening ease and convenience of this algorithm is advantageous for planners and designers trying to improve system reliability by allowing a quick and efficient intervention that may be required at a dispatch center to observe routine operations and/or identify solution alternatives in case of a crisis. Note, s denotes the source and t denotes the target.\",\"PeriodicalId\":270494,\"journal\":{\"name\":\"Annual Symposium Reliability and Maintainability, 2004 - RAMS\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annual Symposium Reliability and Maintainability, 2004 - RAMS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RAMS.2004.1285437\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Symposium Reliability and Maintainability, 2004 - RAMS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAMS.2004.1285437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

该工具使用一种新颖的“压缩算法”,通过首先找到所有现有路径,然后通过算法压缩所有冗余组件重复,最后计算精确的可靠性并创建拓扑编码,能够将任何复杂的串并联系统简化为可靠性框图(RBD)中可见的串并联块序列。本文提出了一种基于波光编码方法的混合状态枚举算法,用于计算复杂网络的精确s-t可靠性。该算法的图形筛选的简易性和便利性,对于试图提高系统可靠性的规划者和设计师来说是有利的,因为调度中心可能需要进行快速有效的干预,以观察日常操作和/或在危机情况下确定替代解决方案。注意,s表示源,t表示目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A reliability block diagramming tool to describe networks
The proposed tool, using a novel "compression algorithm" is capable of reducing any complicated series-parallel system to a visible sequence of series and parallel blocks in a reliability block diagram (RBD) by first finding all existing paths, then algorithmically compressing all redundant component duplications and finally calculating an exact reliability and creating an encoding of the topology. A fast algorithm to perform state enumeration in a hybrid form assisted by the polish encoding approach on complex networks to compute the exact s-t reliability is in progress by the authors. The graphical screening ease and convenience of this algorithm is advantageous for planners and designers trying to improve system reliability by allowing a quick and efficient intervention that may be required at a dispatch center to observe routine operations and/or identify solution alternatives in case of a crisis. Note, s denotes the source and t denotes the target.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信