document: An efficient algorithm for sequential generation of failure states in a network with multi-mode components In this work , a new algorithm for the sequential generation of failure states in a network with multi-mode components is proposed . The algorithm presented in the paper transforms the state enumeration problem into a K-shortest paths problem . Taking advantage of the inherent efficiency of an algorithm for shortest paths enumeration and also of the characteristics of the reliability problem in which it will be used , an algorithm with lower complexity than the best algorithm in the literature for solving this problem , was obtained . Computational results will be presented for comparing the efficiency of both algorithms in terms of CPU time and for problems of different size
doc_bio_tags: O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O
extractive_keyphrases: state enumeration problem cpu time
abstractive_keyphrases: multi-mode components reliability sequential failure states generation algorithm network failure states k-shortest paths problem