Next-State Equations of Asynchronous Sequential Machines
G. Saucier · IEEE Transactions on Computers · 1972
A theorem and two applications are given here to solve the problem of selecting state assignments of asynchronous machines. The assignment has to produce a set of simple next-state equations. The proofs use the algebraic structures defined by Hartmanis. A first illustration is given by Liu's encoding; likewise, Tracey's selection theorems are easily found again and placed in a more general context.