An Algorithm for Obtaining Simplified Prime Implicant Sets in Fault-Tree and Event-Tree Analysis (Q3323672)
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 3854779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Algorithm for Obtaining Simplified Prime Implicant Sets in Fault-Tree and Event-Tree Analysis |
scientific article; zbMATH DE number 3854779 |
Statements
An Algorithm for Obtaining Simplified Prime Implicant Sets in Fault-Tree and Event-Tree Analysis (English)
0 references
1983
0 references
non-coherent fault tree
0 references
prime implicant set
0 references
event trees
0 references
minimal cut set
0 references
accident sequence
0 references
approximate probability calculations
0 references
Asymptotic convergence
0 references
0.8037894368171692
0 references
0.7873570919036865
0 references
0.7812156677246094
0 references
0.779499351978302
0 references
