Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs

DOI10.1016/0167-6377(96)00026-0zbMath0873.90039OpenAlexW2069546543MaRDI QIDQ1360110

Frank K. Hwang, Paul E. Wright

Publication date: 15 July 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(96)00026-0

zbMATH Keywords

fault-tolerancefork-join networks\(n\)-parallel-task graphreplicated task systems

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Generalization of an engineering principle
• Reliability analysis of a simple replicated and-fork/and-join graph
• Assembly at system level versus component level

This page was built for publication: Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs