Evaluation of Large Fault-Trees with Repeated Events Using an Efficient Bottom-Up Algorithm
From MaRDI portal
Publication:3722245
Recommendations
- scientific article; zbMATH DE number 686986
- A Truncation Methodology for Evaluating Large Fault Trees
- Fast fault-tree evaluation for many sets of input data
- scientific article; zbMATH DE number 4211242
- scientific article; zbMATH DE number 3898592
- scientific article; zbMATH DE number 3987015
- Reliability analysis of systems described by fault trees with efficiency
Cited in
(13)- 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
- A Truncation Methodology for Evaluating Large Fault Trees
- scientific article; zbMATH DE number 4211242 (Why is no real title available?)
- Evaluating fault trees (AND and OR gates only) with repeated events
- Intrinsic ordering, combinatorial numbers and reliability engineering
- scientific article; zbMATH DE number 3956790 (Why is no real title available?)
- scientific article; zbMATH DE number 4083345 (Why is no real title available?)
- Fault trees and imperfect coverage
- scientific article; zbMATH DE number 686986 (Why is no real title available?)
- Evaluating FTRE's for dependability measures in fault tolerant systems
- Fast fault-tree evaluation for many sets of input data
- Fault trees from data: efficient learning with an evolutionary algorithm
This page was built for publication: Evaluation of Large Fault-Trees with Repeated Events Using an Efficient Bottom-Up Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3722245)