Fast fault-tree evaluation for many sets of input data

DOI10.1109/24.103006MaRDI QIDQ5202015zbMATH OpenOpenAlexFDO

Authors Winfrid G. Schneeweiss

Publication date 1990

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

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

zbMATH Keywords

failure frequencybinary-tree algorithmsSystem unavailability

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Evaluation of Large Fault-Trees with Repeated Events Using an Efficient Bottom-Up Algorithm
• scientific article; zbMATH DE number 3987015
• Approximate Fault-Tree Analysis with Prescribed Accuracy
• Fault-Tree Analysis Using a Binary Decision Tree
• Uncertainty Analysis of Fault-Tree Outputs

Cited in

(3)

• Addendum to: Computing Failure Frequency via Mixed Products of Availabilities and Unavailabilities
• Uncertainty Analysis of Fault-Tree Outputs
• Evaluation of Large Fault-Trees with Repeated Events Using an Efficient Bottom-Up Algorithm

This page was built for publication: Fast fault-tree evaluation for many sets of input data

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