This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
State Assignment of Asynchronous Sequential Machines Using Graph Techniques
March 1972 (vol. 21 no. 3)
pp. 282-288
Gabriele Saucier, Centre National de la Recherche Scientifique, Institute of Applied Mathematics, University of Grenoble, Grenoble, France.
A new algorithm for asynchronous machines is presented. The problem is formulated and solved in graph-theoretic terms. A graph-embedding algorithm in an n-cube developed in Sections I-III is used to establish the encoding method. The resulting critical race free encoding minimizes the dimensions of the internal variables and the transition times. This method should be especially interesting for large incomplete machines.
Citation:
Gabriele Saucier, "State Assignment of Asynchronous Sequential Machines Using Graph Techniques," IEEE Transactions on Computers, vol. 21, no. 3, pp. 282-288, March 1972, doi:10.1109/TC.1972.5008950
Usage of this product signifies your acceptance of the Terms of Use.