Evaluation of Large Fault-Trees with Repeated Events Using an Efficient Bottom-Up Algorithm (Q3722245)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3952472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Evaluation of Large Fault-Trees with Repeated Events Using an Efficient Bottom-Up Algorithm |
scientific article; zbMATH DE number 3952472 |
Statements
Evaluation of Large Fault-Trees with Repeated Events Using an Efficient Bottom-Up Algorithm (English)
0 references
1986
0 references
Boolean evaluation
0 references
fault-tree analysis
0 references
large fault-trees
0 references
bottom-up algorithm
0 references
repeated events
0 references
0.87197244
0 references
0.85683453
0 references
