An Efficient Bottom-up Algorithm for Enumerating Minimal Cut Sets of Fault Trees

DOI10.1109/TR.1979.5220639zbMath0421.90029MaRDI QIDQ3854904

Kyoichi Nakashima, Yoshio Hattori

Publication date: 1979

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

zbMATH Keywords

reliabilitycomputational resultsfault treesefficient bottom-up algorithmentire computer programenumerating minimal cut sets

Mathematics Subject Classification ID

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

Related Items (1)

Fault trees -- problems and the modern state of investigations

This page was built for publication: An Efficient Bottom-up Algorithm for Enumerating Minimal Cut Sets of Fault Trees