An Efficient Bottom-up Algorithm for Enumerating Minimal Cut Sets of Fault Trees (Q3854904)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Efficient Bottom-up Algorithm for Enumerating Minimal Cut Sets of Fault Trees |
scientific article; zbMATH DE number 3655649
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Efficient Bottom-up Algorithm for Enumerating Minimal Cut Sets of Fault Trees |
scientific article; zbMATH DE number 3655649 |
Statements
An Efficient Bottom-up Algorithm for Enumerating Minimal Cut Sets of Fault Trees (English)
0 references
1979
0 references
efficient bottom-up algorithm
0 references
enumerating minimal cut sets
0 references
fault trees
0 references
entire computer program
0 references
computational results
0 references
reliability
0 references
