State assignment for asynchronous state machines

A state assignment method is described for asynchronous circuits based on simulated annealing that produces race-free multiple transition time assignments. Simulated annealing is used to obtain a good initial assignment. An algorithmic cleanup procedure is used to guarantee that each state transition is race free. The user is allowed to specify timing constraints on the resulting logic, which influences state assignment to assign adjacent states where fast transitions are required. The system has been implemented in C++, and has been tested on a variety of circuits with up to 100 states.<
>