Tight steady-state availability bounds using the failure distance concept
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/21067
Tipus de documentArticle
Data publicació1998-09
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
Continuous-time Markov chains are commonly used for dependability modeling of repairable
fault-tolerant computer systems. Realistic models of non-trivial fault-tolerant systems often have very large state spaces. An attractive approach for dealing with the largeness problem is the use of pruningmethods with error bounds. Several such methods for computing steady-state
availability bounds have been proposed recently. This paper presents a new method which exploits the failure distance concept to bound more efficiently the behavior in the non-generated state space. It is proved that the bounding method gives tighter bounds than previous methods.
Numerical analysis shows that the new bounds can be significantly tighter.
CitacióCarrasco, J. Tight steady-state availability bounds using the failure distance concept. "Performance evaluation", Setembre 1998, vol. 34, núm. 1, p. 27-64.
ISSN0166-5316
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
PEVA_98.pdf | 294,1Kb | Visualitza/Obre |