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}
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.