|
Volumn , Issue , 2004, Pages 207-213
|
Minimal cut set/sequence generation for dynamic fault trees
|
Author keywords
Binary Decision Diagram; Dynamic Fault Tree; Minimal Cut Set Sequence; Static Fault Tree; Zero suppressed BDD
|
Indexed keywords
BINARY DECISION DIAGRAM;
DYNAMIC FAULT TREE;
MINIMAL CUT SET/SEQUENCE;
STATIC FAULT TREE;
ZERO-SUPPRESSED BDD;
DYNAMIC FAULT TREES;
EFFICIENT DATA STRUCTURES;
FAULT-TREES;
MINIMAL CUTSETS;
SEQUENCE GENERATION;
SET REPRESENTATION;
ZERO-SUPPRESSED BINARY DECISION DIAGRAMS;
COMPUTER ARCHITECTURE;
DATA STORAGE EQUIPMENT;
DATA STRUCTURES;
FAULT TOLERANT COMPUTER SYSTEMS;
PROBABILITY;
PROBLEM SOLVING;
SET THEORY;
BINARY DECISION DIAGRAMS;
BINS;
BOOLEAN FUNCTIONS;
COMPUTATIONAL EFFICIENCY;
DECISION THEORY;
ELECTRIC FAULT CURRENTS;
MAINTAINABILITY;
MARKOV PROCESSES;
QUALITY CONTROL;
FAULT TREE ANALYSIS;
BINARY TREES;
|
EID: 2342504409
PISSN: 0149144X
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (110)
|
References (17)
|