The identifiability problem for repairable systems subject to competing risks

Tools

Bedford, T.J. and Lindqvist, B. (2004) The identifiability problem for repairable systems subject to competing risks. Advances in Applied Probability, 36 (3). pp. 774-790. (http://dx.doi.org/10.1239/aap/1093962233)

Full text not available in this repository.Request a copy

Abstract

Within reliability theory, identifiability problems arise through competing risks. If we have a series system of several components, and if that system is replaced or repaired to as good as new on failure, then the different component failures represent competing risks for the system. It is well known that the underlying component failure distributions cannot be estimated from the observable data (failure time and identity of failed component) without nontestable assumptions such as independence. In practice many systems are not subject to the 'as good as new' repair regime. Hence, the objective of this paper is to contrast the identifiability issues arising for different repair regimes. We consider the problem of identifying a model within a given class of probabilistic models for the system. Different models corresponding to different repair strategies are considered: a partial-repair model, where only the failing component is repaired; perfect repair, where all components are as good as new after a failure; and minimal repair, where components are only minimally repaired at failures. We show that on the basis of observing a single socket, the partial-repair model is identifiable, while the perfect- and minimal-repair models are not.

ORCID iDs

Bedford, T.J. ORCID logoORCID: https://orcid.org/0000-0002-3545-2088 and Lindqvist, B.;
CORE (COnnecting REpositories)