DocumentCode
1053974
Title
An explicit solution for the number of minimal p -cutsequences in a consecutive-k -out of-n :F system
Author
Hwang, F.K.
Author_Institution
AT&T Bell Lab., Murray Hill, NJ, USA
Volume
40
Issue
5
fYear
1991
fDate
12/1/1991 12:00:00 AM
Firstpage
553
Lastpage
554
Abstract
R.C. Bollinger and A.A. Salvia (see ibid., vol. R-34, p. 43-5, Apr. 1985) proposed an approach to study the failure-time distribution of a consecutive-k -out-of-n :F system by studying the number of minimal p -cutsequences. They gave recursive equations to compute this number for independent identically distributed components. It is shown that the recursive equations have an explicit solution
Keywords
failure analysis; reliability theory; consecutive-k-out of-n:F system; failure-time distribution; i.i.d. components; independent identically distributed components; minimal p-cutsequences; recursive equations; reliability; Closed-form solution; Combinatorial mathematics; Convolution; Distributed computing; Equations; Reliability theory;
fLanguage
English
Journal_Title
Reliability, IEEE Transactions on
Publisher
ieee
ISSN
0018-9529
Type
jour
DOI
10.1109/24.106775
Filename
106775
Link To Document