A Recursive Algorithm for Computing Exact Reliability Measures

DOI10.1109/TR.1986.4335338MaRDI QIDQ3718469zbMATH OpenFDO

Authors Michael Page Bailey, Vidyadhar G. Kulkarni

Publication date 1986

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

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

zbMATH Keywords

degree of connectednessdirected graphdiscrete-time Markov chainindependent arc failuresnetwork reliabilityreliability measuresource-to-K-terminal reliabilitysource-to-sink connectednesstwo absorbing states

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Reliability, availability, maintenance, inspection in operations research (90B25) Applications of mathematical programming (90C90)

Recommendations

• A decomposition algorithm for network reliability evaluation
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• Computational Science and Its Applications – ICCSA 2004
• An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
• A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability

Cited in

(4)

• A Method of Rapid Markov Reliability Calculation
• Recursive Technique For Computing System Reliability
• Computational Science - ICCS 2004
• Two-terminal reliability of the K₄-ladder -- revisited

This page was built for publication: A Recursive Algorithm for Computing Exact Reliability Measures

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