Abstract

By applying shortest path analysis in stochastic networks, we introduce a new approach to obtain the reliability function of time-dependent systems with standby redundancy. We assume that not all elements of the system are set to function from the beginning. Upon the failure of each element of the active path in the reliability graph, the system switches to the next path. Then, the corresponding elements are activated and consequently the connection between the input and the output is established. It is also assumed each element exhibits a constant hazard rate and its lifetime is a random variable with exponential distribution. To evaluate the system reliability, we construct a directed stochastic network called E-network, in which each path corresponds with a minimal cut of the reliability graph. We also prove that the system failure function is equal to the density function of the shortest path of E-network. The shortest path distribution of this new constructed network is determined analytically using continuous-time Markov processes.

Author Keywords: Reliability; Markov processes; Graph theory

Article Outline

1. Introduction

2. Reliability graphs

2.1. Equivalent network

3. Distribution function of shortest path in stochastic networks

4. Numerical example

5. Conclusion

References