Synthesis of Hazard-Free Control Circuits from Asynchronous Finite State Machines Specifications

  • Tam-Anh Chu


We discuss a special class of state machine specifications called Asynchronous Finite State Machines (AFSM) which allows the specification and synthesis of hazard-free control circuits under the unbounded delay model. AFSM are useful for the specification of sequential behavior involving choices. In contrast, models such Signal Transition Graphs (STGs) are more amenable to the specification of deterministic concurrent behavior. AFSM specifications are transformed into STGs and then to State Graphs (SGs). At the SG level of representation, hazards can be identified as a type of violations of the Complete State Coding (CSC) property. Algorithms for obtaining SGs from AFSMs, and conditions for hazard-free implementation of SG derived from AFSM are discussed. A hazard-free synthesis technique from SG is described. A CAD prototype called CLASS (Cirrus Logic Asynchronous Synthesis System) has been built and used to successfully synthesize and verify the state machine benchmark from HP Laboroatories [1] and various other real applications.


State Graph Simple Cycle Gate Delay Critical Race Asynchronous Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K.S. Stevens, S.V. Robinson, and A.L. Davis, “The post office-communication support for distributed ensemble architectures,” Sixth International Conference on Distributed Computing Systems, 1986.Google Scholar
  2. 2.
    T. Meng, R.W. Brodersen, and G. Messerschmitt, “Implementation of high sampling rate adaptive filters using asynchronous design techniques,” VLSI Signal Processing, III, Chapter 20, IEEE Press, 1988.Google Scholar
  3. 3.
    T.-A. Chu, “Synthesis of self-timed VLSI circuits from graph-theoretic specifications,” Proc. ICCD, IEEE, Oct. 1987, pp. 220–223.Google Scholar
  4. 4.
    T.-A. Chu, “Synthesis of self-timed VLSI circuits from graph-theoretic specifications,” Ph.D. Thesis, Dept. of EECS, MIT, June 1987. Also available as MIT Lab. for Computer Science TR 393, 1987.Google Scholar
  5. 5.
    A.J. Martin, “Compiling Communicating Processes into Delay-Insensitive VLSI Circuits,” Journal of Distributed Computing, Vol. 1, 1986, pp. 226–234.MATHCrossRefGoogle Scholar
  6. 6.
    C.H. van Berkel and R. Saeijs, “Compilation of communicating processes in delay insensitive circuits,” Proc. ICCD, 1988, pp. 157–162.Google Scholar
  7. 7.
    A.J. Martin et al., “The design of an asynchronous microprocessor,” Proc. of the 1989 Decennial Caltech Conference, ed. C. Seitz.Google Scholar
  8. 8.
    C. Seitz, “Self-timed VLSI systems,” Proc. Caltech Conf. on VLSI, Jan. 1979.Google Scholar
  9. 9.
    P. Beerel and T. Meng, “Gate-level synthesis of speed-independent asynchronous control logic” Proceedings of ICCAD’ 92, Nov. 1992, pp. 581–586.Google Scholar
  10. 10.
    V.I. Varshavsky, et al., Self-Timed Control of Concurrent Processes, Chapter 5, Boston, MA: Kluwer Academic Publishers, 1990.MATHCrossRefGoogle Scholar
  11. 11.
    L. Lavagno, K. Keutzer, and A. Sangiovanni-Vincentelli, “Algorithms for synthesis of hazard-free asynchronous control circuits,” Proc. DAC, June 1991.Google Scholar
  12. 12.
    C. Moon, P. Stephan, and R. Brayton, “Synthesis of hazard-free asynchronous circuits from graphical specifications,” Proc. ICCAD, Nov. 1991.Google Scholar
  13. 13.
    J. Ebergen, “Translation of programs into delay-insensitive circuits,” Ph.D. Thesis, Eindhoven Univ. of Technology, 1987.Google Scholar
  14. 14.
    T.-A. Chu and L.A. Glasser, “Synthesis of self-timed control circuits from graphs: an example,” Proc. ICCD, IEEE, Oct. 1986, pp. 565–571.Google Scholar
  15. 15.
    P. Vanbekbergen et al. “Optimized synthesis of asynchronous control circuits from graph-theoretic specifications,” Proc. ICCAD, 1990, pp. 184–187.Google Scholar
  16. 16.
    T. Meng, R.W. Brodersen, and G. Messerchmitt, “Automatic synthesis of asynchronous circuits from high level specifications,” Transactions on CAD, vol. 8, Nov. 1989, pp. 1185–1205.Google Scholar
  17. 17.
    S. Nowick and D. Dill, “Automatic synthesis of locally clocked asynchronous state machines,” Proc. ICCAD, 1991.Google Scholar
  18. 18.
    J.H. Tracey, “Internal state assignments for asynchronous sequential machines,” IEEE Trans. Electronic Computers, vol. EC-15, 1966, pp. 551–560.CrossRefGoogle Scholar
  19. 19.
    L. Lavagno, C. Moon, R. Brayton, and A. Sangiovanni-Vincentelli, “Solving the state assignment problem for signal transition graphs,” Proc. DAC, June 1992.Google Scholar
  20. 20.
    T.-A. Chu, N. Mani, and C.K.C. Leung, “A new state assignment technique for asynchronous finite state machines,” Proc. DAC, Dallas, TX, June 1993, pp. 2–6.Google Scholar
  21. 21.
    T.-A. Chu, “CLASS: a CAD system for the automatic synthesis and verification of asynchronous finite state machine specifications,” Proc. Hawaiin International Conference on System Sciences, Special Track on Asynchronous Design and Systems, January 1993.Google Scholar
  22. 22.
    M.A. Kishinevsky, et al. “On self-timed behavior verification,” Proc. TAU’ 92, Princeton, March 1992.Google Scholar
  23. 23.
    D.B. Armstrong, A.D. Friedman, and PR. Menon, “Design of asynchronous circuits assuming unbounded gate delays” IEEE Trans. Computers, vol. C-18, 1969, pp. 1110–1120.CrossRefGoogle Scholar
  24. 24.
    D. Dill, “Trace theory for automatic hierarchical verification of speed-independent circuits,” ACM Distinguished Dissertation Series.Google Scholar

Copyright information

© Springer Science+Business Media New York 1994

Authors and Affiliations

  • Tam-Anh Chu
    • 1
  1. 1.Cirrus Logic, Inc.FremontUSA

Personalised recommendations