Name
Abstract | ||
|---|---|---|
The two-terminal reliability problem has been a widely studied issue since 1970s. Therefore many efficient algorithms were proposed. Nevertheless, all these algorithms imply that all system components must be independent. With regard to nowadays applications it is not sufficient to assume independent component failures because in fault tolerant systems components may fail due to common cause failures or fault propagation. We therefore propose an algorithm which deals with upcoming dependencies. In addition to that, lower and upper bounds can be obtained in case the algorithm cannot be conducted until the end. The performance and accuracy of the algorithm is demonstrated on a certain network obeying a recursive structure where the exact result is given by a polynomial. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-28540-0_3 | MMB/DFT |
Keywords | Field | DocType |
two-terminal network reliability,fault propagation,dependent basic event,independent component failure,exact result,recursive structure,fault tolerant systems component,common cause failure,two-terminal reliability problem,system component,efficient algorithm,certain network | Polynomial,Binary decision diagram,Algorithm,Theoretical computer science,Fault tolerance,Reliability (computer networking),Common cause failure,Mathematics,Recursion,Fault propagation | Conference |
Citations | PageRank | References |
4 | 0.50 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minh Lê | 1 | 8 | 2.29 |
| Max Walter | 2 | 54 | 9.17 |