A failure-distance dased method to bound the reliability of non-repairable fault-tolerant systems without the knowledge of minimal cuts
CTMC (continuous-time Markov chains) are a commonly used formalism for modeling fault-tolerant systems. One of the major drawbacks of CTMC is the well-known state-space explosion problem. This paper develops and analyzes a method (SC-BM) to compute bounds for the reliability of nonrepairable fault-t...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2001 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/19939 |
| Acesso em linha: | https://hdl.handle.net/2117/19939 |
| Access Level: | acceso abierto |
| Palavra-chave: | Fault-tolerant computing Tolerància als errors (Informàtica) Àrees temàtiques de la UPC::Matemàtiques i estadística::Estadística matemàtica |
| Resumo: | CTMC (continuous-time Markov chains) are a commonly used formalism for modeling fault-tolerant systems. One of the major drawbacks of CTMC is the well-known state-space explosion problem. This paper develops and analyzes a method (SC-BM) to compute bounds for the reliability of nonrepairable fault-tolerant systems in which only a portion of the state space of the CTMC is generated. SC-BM uses the failure distance concept as the method described in [1] but, unlike that method, which is based on the computation of exact failure distances, SC-BM uses lower bounds for failure distances, which are computed on the system fault-tree, avoiding the computation and holding of all minimal cuts as required in [1]. This is important because computation of all minimal cuts is NP-hard and the number of minimal cuts can be very large. In some cases SC-BM gives exactly the same bounds as the method in [1]; in other cases it gives less tighter bounds. SC-BM computes tight bounds for the reliability of quite complex systems with an affordable number of generated states for short to quite large mission times. The analysis of several examples seems to show that the bounds obtained by SC-BM appreciably outperform those obtained by simpler methods, e.g., [2], and, when they are not equal, are only slightly worse than the bounds obtained by the method in [1]. In addition, the overhead in CPU time due to computing lower bounds for failure distances seems to be reasonable. |
|---|