Fast Recursive Algorithm to Evaluate the Reliability of a Circular Consecutive-k-out-of-n:F System

DOI10.1109/TR.1987.5222303MaRDI QIDQ3800852zbMATH OpenOpenAlexFDO

Authors Ira N. Antonopoulou, Stavros Papastavridis

Publication date 1987

Published in IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tr.1987.5222303

zbMATH Keywords

reliability

Mathematics Subject Classification ID

Applications of renewal theory (reliability, demand theory, etc.) (60K10) Reliability, availability, maintenance, inspection in operations research (90B25)

Cited in

(5)

• Redundant consecutive-k systems
• Markov binomial distribution of order k and its applications
• Reliabilities of Consecutive-2 Graphs
• Strict circular consecutivekout ofnsystems
• On a generalizedk-out-of-nsystem and its reliability

This page was built for publication: Fast Recursive Algorithm to Evaluate the Reliability of a Circular Consecutive-k-out-of-n:F System

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3800852)