An Algorithm for Reducing Cut Sets in Fault-Tree Analysis

DOI10.1109/TR.1986.4335545MaRDI QIDQ3747210zbMATH OpenFDO

Authors

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

zbMATH Keywords

cut-set reductionfault-tree algorithmminimal cut sets

Mathematics Subject Classification ID

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

Recommendations

• From Fault-Tree To Fault-Identification
• Fault-Tree Analysis Using a Binary Decision Tree
• scientific article; zbMATH DE number 1328976
• An Algorithm for Obtaining Simplified Prime Implicant Sets in Fault-Tree and Event-Tree Analysis
• A research on a fault tree minimal cut set generation algorithm based on binary decision diagram

Cited in

(7)

• An algorithm for the estimation of minimal cut and path sets from field failure data
• Hierarchical differential evolution for minimal cut sets identification: application to nuclear safety systems
• An Algorithm for Obtaining Simplified Prime Implicant Sets in Fault-Tree and Event-Tree Analysis
• An Algorithm for Exact Fault-Tree Probabilities without Cut Sets
• scientific article; zbMATH DE number 1328976 (Why is no real title available?)
• An algorithm for solving minimal cut set of causality diagram by Petri net model
• A research on a fault tree minimal cut set generation algorithm based on binary decision diagram

This page was built for publication: An Algorithm for Reducing Cut Sets in Fault-Tree Analysis

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