An O(n) algorithm to compute the reliability of consecutive k-out-of-r-fcom-n :F system under the condition of r < 2k

被引:0
|
作者
Higashiyama, Yoichi [1 ]
Cai, Xu [1 ]
Rumchev, Ventsi [2 ]
机构
[1] Ehime Univ, Dept Elect & Elect Engn, Matsuyama, Ehime 7908577, Japan
[2] Curtin Univ Technol, Dept Math & Stat, Perth, WA 6845, Australia
关键词
consecutive k-out-of-r-from-n:F system; exact solution; recursive method;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A consecutive k-out-of-r-from-n :F system consists of n ordered components such that the system fails if and only if there are r consecutive components at least of which are failed. Such systems arise in quality -control problems and inspection procedures as well as in radar detection. This paper studies the reliability of a linear consecutive k-out-of-r-from-n :F system in the general case when the component probabilities can be different from each other. New recursive equation is derived for explicit solution of such general system, which required O(n) computing time. The results of some computational experiments are also described.
引用
收藏
页码:151 / 154
页数:4
相关论文
共 50 条