Efficient reliability computation of consecutive-k-out-of-n: F systems with shared components

Consecutive- k systems have been studied extensively in reliability engineering. Linear and circular consecutive- k-out-of- n: F systems with shared component(s) have been studied recently by Lin et al. and Yin and Cui . They considered two adjacent subsystems overlapping with one (multiple) shared component(s), respectively, and obtained system reliability formulas by summing the reliability values for all disjoint cases. As their method is computationally intensive, it would be of interest to develop a simpler and more efficient method for the computation of the reliability function of such systems instead of requiring to list all disjoint cases. In this work, by employing the finite Markov chain imbedding approach, we develop unified formulas as products of matrices for evaluating system reliabilities by redefining the state space of the Markov chain. The results developed here decrease the complexity in the computation of system reliability. Furthermore, the new method is also employed to obtain reliability formulas for Markov-dependent cases. A case study of communication systems is finally presented and some numerical examples are presented to illustrate the developed model and the corresponding results.

Efficient reliability computation of consecutive-k-out-of-n: F systems with shared components Journal Articles