|
| 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
| ASCII Text | x | ||
| Gabriele Saucier, "State Assignment of Asynchronous Sequential Machines Using Graph Techniques," IEEE Transactions on Computers, vol. 21, no. 3, pp. 282-288, March, 1972. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1972.5008950, author = {Gabriele Saucier}, title = {State Assignment of Asynchronous Sequential Machines Using Graph Techniques}, journal ={IEEE Transactions on Computers}, volume = {21}, number = {3}, issn = {0018-9340}, year = {1972}, pages = {282-288}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1972.5008950}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - State Assignment of Asynchronous Sequential Machines Using Graph Techniques IS - 3 SN - 0018-9340 SP282 EP288 EPD - 282-288 A1 - Gabriele Saucier, PY - 1972 VL - 21 JA - IEEE Transactions on Computers ER - | |||
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.