Consecutive-k-out-of-n: F Networks

1 April 1982

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability

Vol. R-31 (1), 53-56
https://doi.org/10.1109/tr.1982.5221227

Abstract

This paper develops a counting scheme for determining the reliability of a consecutive-k-out-of-n:F network. An example of such a network, a set of tables, and a comparative example are provided.

Keywords

This publication has 17 references indexed in Scilit:

Reliability of Consecutive-k-out-of-n:F System
IEEE Transactions on Reliability, 1981
Reliability Determination of a r-Successive-out-of-n:F System
IEEE Transactions on Reliability, 1980
A Review of Standby Redundant Systems
IEEE Transactions on Reliability, 1980
An Algebraic Technique for Reliability Evaluation
IEEE Transactions on Reliability, 1980
On Complementation of Pathsets and Cutsets
IEEE Transactions on Reliability, 1980
A Method of Symbolic Steady-State Availability Evaluation of k-out-of-n:G System
IEEE Transactions on Reliability, 1979
Analysis of a Dynamic Redundant System
IEEE Transactions on Reliability, 1978
Bibliography for Reliability and Availability of Stochastic Systems
IEEE Transactions on Reliability, 1976
Availability of the 2-out-of-n: F System
IEEE Transactions on Reliability, 1976
General Solution to the Occupancy Problem with Variably Sized Runs of Adjacent Cells Occupied by Single Balls
Mathematics Magazine, 1975

Cited by 87 articles