Fault trees -- problems and the modern state of investigations

DOI10.1007/BF02366477zbMath0838.90053OpenAlexW2144970004MaRDI QIDQ1905159

N. Yu. Kuznetsov

Publication date: 8 January 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02366477

zbMATH Keywords

fault treesreplicated gates

Mathematics Subject Classification ID

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

Related Items (1)

Models of the optimal resource allocation for the critical infrastructure protection

Uses Software

• MOCUS
• PREP/KITT
• FATRAM
• ELRAFT
• FAMOCUTN
• PAFT F77
• CRESSEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-Component Systems and Structures and Their Reliability
• Evaluating fault trees (AND and OR gates only) with repeated events
• Fault Tree Analysis, Methods, and Applications ߝ A Review
• Modularizing and Minimizing Fault Trees
• Evaluation of Large Fault-Trees with Repeated Events Using an Efficient Bottom-Up Algorithm
• An Algorithm for Exact Fault-Tree Probabilities without Cut Sets
• An Algorithm for Symbolic Reliability Computation with Path-sets or Cut-sets
• An Efficient Bottom-up Algorithm for Enumerating Minimal Cut Sets of Fault Trees
• Efficient Construction of Minimal Cut Sets from Fault Trees
• Time Dependent Unavailability Analysis of Nuclear Safety Systems
• An Efficient Simple Algorithm for Fault Tree Automatic Synthesis from the Reliability Graph
• FATRAM-A Core Efficient Cut-Set Algorithm
• Approaches to Comparing Cut-Set Enumeration Algorithms
• Modules of Coherent Binary Systems

This page was built for publication: Fault trees -- problems and the modern state of investigations