Reliability of a consecutive k-out-of-r-from-n:F system
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 41 (3) , 442-447
- https://doi.org/10.1109/24.159817
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- A rearrangement inequality for the longest run, with an application to network reliabilityJournal of Applied Probability, 1985
- Simple Inequalities for Consecutive-k-out of-n:F NetworksIEEE Transactions on Reliability, 1982
- Recursive Algorithm to Evaluate the Reliability of a Consecutive-k-out-of-n:F SystemIEEE Transactions on Reliability, 1982
- Reliability of Consecutive-k-out-of-n:F SystemIEEE Transactions on Reliability, 1981
- Minimal-Order Models for False-Alarm Calculations on Sliding WindowsIEEE Transactions on Aerospace and Electronic Systems, 1978
- Note on a clustering problemJournal of Applied Probability, 1975
- Probabilities for a Generalized Birthday ProblemJournal of the American Statistical Association, 1974
- On Bonferroni-Type Inequalities of the Same Degree for the Probability of Unions and IntersectionsThe Annals of Mathematical Statistics, 1972
- The Generalized Birthday ProblemJournal of the American Statistical Association, 1972
- An Extension of the Birthday ProblemThe American Statistician, 1968