{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T22:57:44Z","timestamp":1759964264737},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Reliability Engineering & System Safety"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0951-8320(02)00006-6","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T21:22:28Z","timestamp":1034630548000},"page":"111-119","source":"Crossref","is-referenced-by-count":10,"title":["An efficient algorithm for sequential generation of failure states in a network with multi-mode components"],"prefix":"10.1016","volume":"77","author":[{"given":"Teresa","family":"Gomes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Craveirinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00facia","family":"Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3,4","key":"10.1016\/S0951-8320(02)00006-6_BIB1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-5316(92)90002-X","article-title":"Performability: a retrospective and some pointers to the future","volume":"14","author":"Meyer","year":"1992","journal-title":"Perform. Eval."},{"issue":"10","key":"10.1016\/S0951-8320(02)00006-6_BIB2","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/TCOM.1984.1095978","article-title":"Performance analysis of networks with unreliable components","volume":"32","author":"Li","year":"1984","journal-title":"IEEE Trans. Commun."},{"issue":"5","key":"10.1016\/S0951-8320(02)00006-6_BIB3","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1109\/TCOM.1986.1096560","article-title":"An improved algorithm for performance analysis of networks with unreliable components","volume":"34","author":"Lam","year":"1986","journal-title":"IEEE Trans. Commun."},{"issue":"2","key":"10.1016\/S0951-8320(02)00006-6_BIB4","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1287\/ijoc.2.4.336","article-title":"An algorithm for network reliability bounds","volume":"2","author":"Yang","year":"1990","journal-title":"ORSA J. Comput."},{"issue":"5","key":"10.1016\/S0951-8320(02)00006-6_BIB5","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1109\/26.24607","article-title":"Efficient computation of most probable states for communication networks with multimode components","volume":"37","author":"Yang","year":"1989","journal-title":"IEEE Trans. Commun."},{"issue":"2","key":"10.1016\/S0951-8320(02)00006-6_BIB6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1049\/ip-com:19981838","article-title":"An algorithm for the sequential generation of states in a failure prone communication network","volume":"145","author":"Gomes","year":"1998","journal-title":"IEE Proc. Commun."},{"issue":"7","key":"10.1016\/S0951-8320(02)00006-6_BIB7","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1109\/JSAC.1986.1146426","article-title":"Reliability analysis of a communication network with multimode components","volume":"4","author":"Chiou","year":"1986","journal-title":"IEEE J. Select. Areas Commun."},{"issue":"3","key":"10.1016\/S0951-8320(02)00006-6_BIB8","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1142\/S0129054199000186","article-title":"Deviation algorithms for ranking shortest paths","volume":"10","author":"Martins","year":"1999","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"10.1016\/S0951-8320(02)00006-6_BIB9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/net.3230090304","article-title":"A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees","volume":"9","author":"Dial","year":"1979","journal-title":"Networks"},{"issue":"2","key":"10.1016\/S0951-8320(02)00006-6_BIB10","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","article-title":"Finding the k shortest paths","volume":"28","author":"Eppstein","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0951-8320(02)00006-6_BIB11","series-title":"Algorithms in C++","author":"Sedgewick","year":"1992"}],"container-title":["Reliability Engineering & System Safety"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0951832002000066?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0951832002000066?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T19:28:01Z","timestamp":1556825281000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0951832002000066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0951832002000066"],"URL":"https:\/\/doi.org\/10.1016\/s0951-8320(02)00006-6","relation":{},"ISSN":["0951-8320"],"issn-type":[{"value":"0951-8320","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}