DocumentCode
811287
Title
m -consecutive-k -out-of-n :F systems
Author
Papastavridis, Stavros
Author_Institution
Div. of Appl. Math., Patras Univ., Athens, Greece
Volume
39
Issue
3
fYear
1990
fDate
8/1/1990 12:00:00 AM
Firstpage
386
Lastpage
388
Abstract
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
Keywords
failure analysis; probability; reliability theory; exact formula; failure probability; limit theorem; m-consecutive-k-out-of-n:F system; recursive formula; reliability; Combinatorial mathematics; Computer networks; Distributed computing; Failure analysis; Petroleum; Pipelines; Probability; Reliability theory; Space vehicles; Vacuum systems;
fLanguage
English
Journal_Title
Reliability, IEEE Transactions on
Publisher
ieee
ISSN
0018-9529
Type
jour
DOI
10.1109/24.103024
Filename
103024
Link To Document