|
Volumn , Issue , 1994, Pages 178-183
|
Direct synthesis of hazard-free asynchronous circuits from STGs based on lock relation and MG-decomposition approach
a a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
BOOLEAN ALGEBRA;
COMPUTATIONAL COMPLEXITY;
ELECTRIC NETWORK SYNTHESIS;
GRAPH THEORY;
HAZARDS AND RACE CONDITIONS;
MINIMIZATION OF SWITCHING NETS;
PETRI NETS;
POLYNOMIALS;
STATE ASSIGNMENT;
BOOLEAN MINIMIZATION;
DIRECT SYNTHESIS ALGORITHMS;
FREE CHOICE PETRI NETS;
HAZARD FREE ASYNCHRONOUS CIRCUITS;
REALIZABILITY;
SIGNAL LOCK RELATION;
SIGNAL TRANSITION GRAPHS;
ASYNCHRONOUS SEQUENTIAL LOGIC;
|
EID: 0028018595
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (10)
|
References (18)
|