Recursive Disjoint Products: A Review of Three Algorithms

DOI10.1109/TR.1982.5221216MaRDI QIDQ3939569zbMATH OpenFDO

Authors Mitchell O. Locks

Publication date 1982

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

Full work available at URL https://doi.org/10.1109/TR.1982.5221216

zbMATH Keywords

2-terminal system reliabilityapproximationsBoolean algebracoherent systemcomparison of algorithmsexact methodsfault-freeminimal cutminimal pathrecursive disjoint product algorithmsrecursive partitions- coherent systems

Mathematics Subject Classification ID

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

Cited in

(5)

• Bayesian inference based on partial monitoring of components with applications to preventive system maintenance
• Fast computation of bounds for two-terminal network reliability
• Algebraic Methods Applied to Network Reliability Problems
• DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS
• A sum of disjoint products algorithm for reliability evaluation of flow networks

This page was built for publication: Recursive Disjoint Products: A Review of Three Algorithms

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