A failure-distance based 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 work develops and analyzes a method (SC-BM) to compute bounds for the reliability of non-repairable fault-t...

Descripción completa

Detalles Bibliográficos
Autores: Suñé, Víctor|||0000-0002-5189-8573, Carrasco, Juan A.|||0000-0001-7757-1651
Tipo de recurso: informe técnico
Fecha de publicación:2000
País:España
Institución: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/7846
Acceso en línea:https://hdl.handle.net/2117/7846
Access Level:acceso abierto
Palabra clave:Markov processes
Fault-tolerant computing
Markov, Processos de
Tolerància als errors (Informàtica)
Àrees temàtiques de la UPC::Informàtica::Automàtica i control
id ES_4b7f32092ad6ef7575fd3a2f7df0bcbb
oai_identifier_str oai:upcommons.upc.edu:2117/7846
network_acronym_str ES
network_name_str España
repository_id_str
spelling A failure-distance based method to bound the reliability of non-repairable Fault-tolerant systems without the knowledge of minimal cutsSuñé, Víctor|||0000-0002-5189-8573Carrasco, Juan A.|||0000-0001-7757-1651Markov processesFault-tolerant computingMarkov, Processos deTolerància als errors (Informàtica)Àrees temàtiques de la UPC::Informàtica::Automàtica i controlCTMC (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 work develops and analyzes a method (SC-BM) to compute bounds for the reliability of non-repairable 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 since computation of all minimal cuts is NP-hard and the number of minimal cuts can be very large. In some cases SCBM gives exactly the same bounds as the method described 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, eg [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.20002000-12-1120102010-06-25reporthttp://purl.org/coar/resource_type/c_93fcAOhttp://purl.org/coar/version/c_b1a7d7d4d402bcceinfo:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/7846reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/78462026-05-27T15:37:01Z
dc.title.none.fl_str_mv A failure-distance based method to bound the reliability of non-repairable Fault-tolerant systems without the knowledge of minimal cuts
title A failure-distance based method to bound the reliability of non-repairable Fault-tolerant systems without the knowledge of minimal cuts
spellingShingle A failure-distance based method to bound the reliability of non-repairable Fault-tolerant systems without the knowledge of minimal cuts
Suñé, Víctor|||0000-0002-5189-8573
Markov processes
Fault-tolerant computing
Markov, Processos de
Tolerància als errors (Informàtica)
Àrees temàtiques de la UPC::Informàtica::Automàtica i control
title_short A failure-distance based method to bound the reliability of non-repairable Fault-tolerant systems without the knowledge of minimal cuts
title_full A failure-distance based method to bound the reliability of non-repairable Fault-tolerant systems without the knowledge of minimal cuts
title_fullStr A failure-distance based method to bound the reliability of non-repairable Fault-tolerant systems without the knowledge of minimal cuts
title_full_unstemmed A failure-distance based method to bound the reliability of non-repairable Fault-tolerant systems without the knowledge of minimal cuts
title_sort A failure-distance based method to bound the reliability of non-repairable Fault-tolerant systems without the knowledge of minimal cuts
dc.creator.none.fl_str_mv Suñé, Víctor|||0000-0002-5189-8573
Carrasco, Juan A.|||0000-0001-7757-1651
author Suñé, Víctor|||0000-0002-5189-8573
author_facet Suñé, Víctor|||0000-0002-5189-8573
Carrasco, Juan A.|||0000-0001-7757-1651
author_role author
author2 Carrasco, Juan A.|||0000-0001-7757-1651
author2_role author
dc.subject.none.fl_str_mv Markov processes
Fault-tolerant computing
Markov, Processos de
Tolerància als errors (Informàtica)
Àrees temàtiques de la UPC::Informàtica::Automàtica i control
topic Markov processes
Fault-tolerant computing
Markov, Processos de
Tolerància als errors (Informàtica)
Àrees temàtiques de la UPC::Informàtica::Automàtica i control
description 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 work develops and analyzes a method (SC-BM) to compute bounds for the reliability of non-repairable 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 since computation of all minimal cuts is NP-hard and the number of minimal cuts can be very large. In some cases SCBM gives exactly the same bounds as the method described 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, eg [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.
publishDate 2000
dc.date.none.fl_str_mv 2000
2000-12-11
2010
2010-06-25
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
AO
http://purl.org/coar/version/c_b1a7d7d4d402bcce
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/7846
url https://hdl.handle.net/2117/7846
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869407564203032576
score 15.300724

Similares en LA Referencia