Fault trees from data: efficient learning with an evolutionary algorithm

DOI10.1007/978-3-030-35540-1_2MaRDI QIDQ6535910zbMATH OpenFDO

Authors Alexis Linard, Doina Bucur, Mariëlle I. A. Stoelinga

Publication date 12 March 2024

Full work available at URL https://doi.org/10.1007/978-3-030-35540-1_2

zbMATH Keywords

cyber-physical systemsevolutionary algorithmfault-tree inductionsafety-critical systems

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Learning and adaptive systems in artificial intelligence (68T05) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50)

Recommendations

• Development of fault tree for reliability studies of a data-processing system
• scientific article; zbMATH DE number 1041842
• Evaluation of Large Fault-Trees with Repeated Events Using an Efficient Bottom-Up Algorithm
• scientific article; zbMATH DE number 1179831
• Reliability analysis of systems described by fault trees with efficiency

Cites work

• A large population size can be unhelpful in evolutionary algorithms
• Fault Tree Analysis, Methods, and Applications ߝ A Review
• Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools
• scientific article; zbMATH DE number 3206656 (Why is no real title available?)
• Large-sample learning of Bayesian networks is NP-hard
• Learning Boolean formulas
• Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach

Cited in

(1)

• Learning attack trees by genetic algorithms

This page was built for publication: Fault trees from data: efficient learning with an evolutionary algorithm

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