Monotone Markov processes with respect to the reversed hazard rate ordering: An application to reliability - Laboratoire d'Analyse et de Mathématiques Appliquées Accéder directement au contenu
Article Dans Une Revue Journal of Applied Probability Année : 2001

Monotone Markov processes with respect to the reversed hazard rate ordering: An application to reliability

Résumé

We consider a repairable system with a finite state space which evolves in time according to a Markov process as long as it is working. We assume that this system is getting worse and worse while running: if the up-states are ranked according to their degree of increasing degradation, this is expressed by the fact that the Markov process is assumed to be monotone with respect to the reversed hazard rate and to have an upper triangular generator. We study this kind of process and apply the results to derive some properties of the stationary availability of the system. Namely, we show that, if the duration of the repair is independent of its completeness degree, then the more complete the repair, the higher the stationary availability, where the completeness degree of the repair is measured with the reversed hazard rate ordering.
Fichier non déposé

Dates et versions

hal-00693742 , version 1 (02-05-2012)

Identifiants

  • HAL Id : hal-00693742 , version 1

Citer

Sophie Mercier. Monotone Markov processes with respect to the reversed hazard rate ordering: An application to reliability. Journal of Applied Probability, 2001, 38 (1), pp.195--208. ⟨hal-00693742⟩
38 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More