|
|
|
Volumn , Issue , 1993, Pages 299-303
|
|
Exploiting cofactoring for efficient FSM symbolic traversal based on transition relation
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
ALGORITHMS;
BOOLEAN ALGEBRA;
COMPUTATIONAL COMPLEXITY;
COMPUTATIONAL METHODS;
FORMAL LOGIC;
GRAPH THEORY;
LOGIC CIRCUITS;
LOGIC DESIGN;
SEQUENTIAL MACHINES;
SET THEORY;
STATE ASSIGNMENT;
STATE SPACE METHODS;
AUTOMATED SYNTHESIS;
BINARY DECISION DIAGRAMS;
COFACTORIZATION;
FINITE STATE MACHINES;
FORMAL VERIFICATION;
GENERALIZED COFACTOR OPERATORS;
SYMBOLIC STATE SPACE TRAVERSAL TECHNIQUES;
TRANSITION FUNCTIONS;
TRANSITION RELATIONS;
FINITE AUTOMATA;
|
|
EID: 0027835827
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (3)
|
|
References (13)
|
