Componentwise decomposition for an efficient reliability computation of systems with repairable components

TitleComponentwise decomposition for an efficient reliability computation of systems with repairable components
Publication TypeJournal Article
Year of Publication1995
AuthorsM Balakrishnan, and K Trivedi
JournalDigest of Papers Ftcs (Fault Tolerant Computing Symposium)
Start Page259
Pagination259 - 268
Date Published01/1995
Abstract

Fault trees and Markov chains are commonly used for dependability modeling. Markov chains are powerful in that various kinds of dependencies can be easily modeled that fault tree models have difficulty capturing, but the state space grows exponentially in the number of components. Fault tree models are adequate for computing the reliability of non-repairable systems, but a state space description becomes necessary for repairable systems due to induced dependencies (even when all failure and repair processes are otherwise independent). In this paper we demonstrate that a decomposition approach can be used to avoid a full-system Markov reliability model for repairable systems with independent failure and repair processes. For an n-component system, n 3-state sub-models can replace a full-system monolithic model. This is an approximation because the parameters used in the sub-model are approximately derived from the monolithic model.

Short TitleDigest of Papers Ftcs (Fault Tolerant Computing Symposium)