Two formulas for computing the reliability of incomplete k-out-of-n:G systems
暂无分享,去创建一个
Reliability computation of highly redundant systems most commonly uses approximate methods. Except for k-out-of-n:G systems or consecutive k-out-of-n:G systems, exact reliability formulas offering a broader range of applicability are rare. This paper gives two new formulas for this purpose: the first handles k-out-of-n:G systems of which some paths are not present; the second allows for the reliability calculation of a coherent binary system in general. Both formulas express system reliability in terms of the reliabilities of k-out-of-n:G systems. In practice, these new formulas cope with highly redundant systems with certain similarities to k-out-of-n:G systems. For example, a reliability of the control-rod system of a nuclear reactor is computed. Although the paper is directed to system reliability, the results can be used for computing the failure probability of a system which in practical applications is sometimes more convenient. In which case, the formulas are to be changed such that a system is given by its minimal cut-sets instead of minimal path-sets, and p should be a component unreliability instead of its reliability. The first proof of formula uses domination theory and, in thus contributes to the state of the art in this field.
[1] Ali M. Rushdi. CHAPTER 5 - Reliability of k-out-of-n Systems , 1993 .
[2] A. Satyanarayana,et al. New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks , 1978 .
[3] Mark K. Chang,et al. Network reliability and the factoring theorem , 1983, Networks.