Efficient exploration of availability models guided by failure distances
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/20780
Tipus de documentArticle
Data publicació1996-05
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
Recently, a method to bound the steady-state availability using the failure distance concept has been proposed. In this paper we refine that method by introducing state space
exploration techniques. In the methods proposed here, the state space is incrementally generated based on the contributions to the steady-state availability band of the states in
the frontier of the currently generated state space. Several state space exploration algorithms are evaluated in terms of
bounds quality and memory and CPU time requirements.
The more efficient seems to be a waved algorithm which expands
transition groups. We compare our new methods with
the method based on the failure distance concept without
state exploration and a method proposed by Souza e Silva
and Ochoa which uses state space exploration but does not use the failure distance concept. Using typical examples we show that the methods proposed here can be significantly more efficient than any of the previous methods.
CitacióCarrasco, J.; Calderón, A.; Escribá, J. Efficient exploration of availability models guided by failure distances. "Performance evaluation review", Maig 1996, vol. 24, núm. 1, p. 242-251.
ISSN0163-5999
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
PER_96.pdf | 1,029Mb | Visualitza/Obre |