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.
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2002
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/4080 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/4080 |