A new state assignment technique for asynchronous finite state machines
T.-A. Chu, Narayana S. Mani, Clement K.C. Leung · 2002
The authors propose an efficient critical race-free state assignment technique for asynchronous finite-state machines under the unbounded gate delay model. Instead of using the Huffman model, it operates on the state graph model, in which all signals are treated uniformly and hazards can be characterized as a violation of the complete state coding (CSC) property. The proposed state assignment technique first detects CSC violations and then eliminates them using a modified greedy graph-coloring heuristic.>