An Efficient Critical Race-Free State Assignment Technique for Asynchronous Finite State Machines

This paper proposes an efficient critical race-free state assignment technique for Asynchronous Finite State Machines. Instead of using the Huffman model, it operates indirectly on the State Graph (SG) model, in which all signals are treated uniformedly 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.