Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 173, Issue 1, Pages 137-149Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2005.02.051
Keywords
reliability; Markov processes; graph theory; complexity
Categories
Ask authors/readers for more resources
A new methodology for the reliability evaluation of an 1-dissimilar-unit non-repairable cold-standby redundant system is introduced in this paper. Each unit is composed of a number of independent components with generalized Erlang distributions of lifetimes, arranged in any general configuration. We also extend the proposed model to the general types of non-constant hazard functions. To evaluate the system reliability, we construct a directed stochastic network with exponentially distributed arc lengths, in which each path of this network corresponds with a particular minimal cut of the reliability graph of system. Then, we present an analytical method to solve the resulting system of differential equations and to obtain the reliability function of the standby system. The time complexity of the proposed algorithm is O(2(n)), which is much less than the standard state-space method with the complexity of O(3(n2)). Finally, we generalize the proposed methodology, in which the failure mechanisms of the components are different. (c) 2005 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available