{"title":"Methods for global reliability evaluation of any large complex system","authors":"M.A. Samad","doi":"10.1016/0143-8174(87)90052-7","DOIUrl":null,"url":null,"abstract":"<div><p>Global reliability (g-reliability) of any complex system is defined and two simplified different methods for evaluating the same are proposed. Both the proposed methods are conceptually simpler and computationally efficient for g-reliability evaluation of any large complex system and effectively applicable to its proper form. They therefore require less computer memory and computational efforts as compared to other existing methods. Proposed methods are applicable to the network having both nodes and branches of finite non-zero failure probability. The efficiency of each method increases with the complexity of the network. Both the proposed methods are also illustrated with examples to demonstrate the effectiveness of each method.</p></div>","PeriodicalId":101070,"journal":{"name":"Reliability Engineering","volume":"18 1","pages":"Pages 47-55"},"PeriodicalIF":0.0000,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0143-8174(87)90052-7","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Reliability Engineering","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0143817487900527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
Global reliability (g-reliability) of any complex system is defined and two simplified different methods for evaluating the same are proposed. Both the proposed methods are conceptually simpler and computationally efficient for g-reliability evaluation of any large complex system and effectively applicable to its proper form. They therefore require less computer memory and computational efforts as compared to other existing methods. Proposed methods are applicable to the network having both nodes and branches of finite non-zero failure probability. The efficiency of each method increases with the complexity of the network. Both the proposed methods are also illustrated with examples to demonstrate the effectiveness of each method.