Issue No. 07 - July (1970 vol. 19)
G.K. Maki , IEEE
Methods already exist for the construction of critical race-free assignments for asynchronous sequential circuits. Some of these methods permit the construction of many assignments for the same flow table. The algorithm presented here consists of two easy to apply tests which select that critical race-free assignment most likely to produce a set of simple next-state equations. The algorithm has been programmed.
Asynchronous sequential circuits, sequential circuit synthesis, sequential machines, state assignment.
G. Maki and J. Tracey, "State Assignment Selection in Asynchronous Sequential Circuits," in IEEE Transactions on Computers, vol. 19, no. , pp. 641-644, 1970.