On consecutive-k-out-of n: F systems (Q1103277)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On consecutive-k-out-of n: F systems |
scientific article |
Statements
On consecutive-k-out-of n: F systems (English)
0 references
1988
0 references
A consecutive k-out-of-n: F system consists of n linearly ordered components. The system fails if and only if at least k consecutive components fail. Here, the system is studied in the general case when the n components are statistically independent and may have different failure probabilities (failure as a function of time is ignored.) Applying the elegant and concise algebraic approach and network diagram representation of \textit{R. E. Barlow} and \textit{F. Proschan} [see: Statistical theory of reliability and life testing (1975; Zbl 0379.62080)] an exact formula for system reliability and algorithms for generating all the minimal path and cut sets are obtained. A lower and three upper bounds of system reliability are given. The paper closes with an analysis of a consecutive 2-out-of-6: F system.
0 references
failure probabilities
0 references
network diagram representation
0 references
system reliability
0 references
algorithms for generating all the minimal path
0 references