Evaluation of Large Fault-Trees with Repeated Events Using an Efficient Bottom-Up Algorithm

DOI10.1109/TR.1986.4335344zbMath0592.90040OpenAlexW1990510536MaRDI QIDQ3722245

Karl Stecher

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.4335344

zbMATH Keywords

bottom-up algorithmBoolean evaluationfault-tree analysisrepeated eventslarge fault-trees

Mathematics Subject Classification ID

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

Related Items (2)

Fault trees -- problems and the modern state of investigations ⋮ Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools

This page was built for publication: Evaluation of Large Fault-Trees with Repeated Events Using an Efficient Bottom-Up Algorithm