A fast reliability-algorithm for the circular m-consecutive-k-out-of-n:F system

被引:0
作者
Higashiyama, Y [1 ]
机构
[1] Ehime Univ, Dept Elect & Elect Engn, Matsuyama, Ehime 7908577, Japan
来源
NINTH ISSAT INTERNATIONAL CONFERENCE ON RELIABILITY AND QUALITY IN DESIGN, 2003 PROCEEDINGS | 2003年
关键词
circular m-consecutive k-out-of-n : F system; system reliability; recursive method;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
An circular m -consecutive- k -out-of- n : F system, consists n components that ordered on a circle. The system fails if and only if there are at least m non-overlapping runs of k consecutive failed components. Such systems arise in telecommunication and oil pipeline systems as well as in computer ring networks. This paper studies the reliability of a circular m -consecutive- k -out-of- n :F system in the general case when the component probabilities can be different from each other. New algorithm is derived for explicit solution of such general system, which requires O(nm(3)k(2)) computing time.
引用
收藏
页码:118 / 121
页数:4
相关论文
共 9 条
[1]   ECONOMICAL DESIGN OF LARGE CONSECUTIVE-K-OUT-OF-N-F SYSTEMS [J].
CHAO, MT ;
LIN, GD .
IEEE TRANSACTIONS ON RELIABILITY, 1984, 33 (05) :411-413
[2]   RELAYED COMMUNICATION VIA CONSECUTIVE-K-OUT-OF-N - F-SYSTEM [J].
CHIANG, DT ;
CHIANG, RF .
IEEE TRANSACTIONS ON RELIABILITY, 1986, 35 (01) :65-67
[3]   RELIABILITY OF CONSECUTIVE-K-OUT-OF-N-F SYSTEM [J].
CHIANG, DT ;
NIU, SC .
IEEE TRANSACTIONS ON RELIABILITY, 1981, 30 (01) :87-89
[4]  
GRIFFITH WS, 1984, IEEE T RELIABILITY R, V33, P411
[5]  
HIGASHIYAMA Y, 1987, P 26 SOC INSTR C ENG, P1217
[6]   FAST SOLUTIONS FOR CONSECUTIVE-K-OUT-OF-N - F-SYSTEM [J].
HWANG, FK .
IEEE TRANSACTIONS ON RELIABILITY, 1982, 31 (05) :447-448
[7]  
Kao SC, 1982, PROC AM STATIST ASS, P309
[8]   RELIABILITY DETERMINATION OF A R-SUCCESSIVE-OUT-OF-N-F SYSTEM [J].
KONTOLEON, JM .
IEEE TRANSACTIONS ON RELIABILITY, 1980, 29 (05) :437-438
[9]   M-CONSECUTIVE-K-OUT-OF-N-F SYSTEMS [J].
PAPASTAVRIDIS, S .
IEEE TRANSACTIONS ON RELIABILITY, 1990, 39 (03) :386-388