M-CONSECUTIVE-K-OUT-OF-N-F SYSTEMS

被引：48

作者：

PAPASTAVRIDIS, S

机构：

[1] Appl Math Div, Univ of Patras,, Athens

来源：

IEEE TRANSACTIONS ON RELIABILITY | 1990年 / 39卷 / 03期

关键词：

D O I：

10.1109/24.103024

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

An m-consecutive-k-out-of-n:F system, consists of n components ordered on a line; the system fails if and only if there are at least m nonoverlapping runs of k consecutive failed components. Three theorems concerning such systems are stated and proved. Theorem one is a recursive formula to compute the failure probability of such a system. Theorem two is an exact formula for the failure probability. Theorem three is a limit theorem for the failure probability.

引用

页码：386 / 388

页数：3

共 20 条

[1]

[Anonymous], 1968, INTRO PROBABILITY TH

[2]

[Anonymous], 1996, STOCHASTIC PROCESSES

[3] CONSECUTIVE-K-OUT-OF-N-F SYSTEM WITH SEQUENTIAL FAILURES [J].