This paper addresses the problem of state assignment for Asynchronous Burst Mode Finite State Machines (ABM-FSMs). We compare an encoding scheme proposed by Fuhrer with the well known Tracey method. We then propose two improvements on Fuhrer's method which dramatically reduce the number of state variables necessary. We also prove the correctness of the instantiated machines. All results mentioned have been verified by a verification method proposed by Kung
No full text
