CLASS: a CAD system for automatic synthesis and verification of asynchronous finite state machines

The author describes algorithms and techniques underlying a CAD system called CLASS (Cirrus Logic Asynchronous Synthesis System) for automatic synthesis and verification of control circuits based on asynchronous finite state machine (AFSM) specifications. AFSM specifications are transformed into signal transition graphs and then to state graphs. Newly developed hazard-free synthesis techniques from state graphs are described. An efficient two-level hierarchical verification technique based on state graph contraction and Dill's verifier is used to verify the logic implementations against the state graph. >

[1]  Victor I. Varshavsky,et al.  Self-Timed Control of Concurrent Processes , 1989 .

[2]  Hugo De Man,et al.  Optimized synthesis of asynchronous control circuits from graph-theoretic specifications , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  David L. Dill,et al.  Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.

[4]  David E. Muller.  The General Synthesis Problem for Asynchronous Digital Networks , 1967, SWAT.

[5]  Tam-Anh Chu,et al.  Synthesis of self-timed VLSI circuits from graph-theoretic specifications , 1987 .

[6]  David L. Dill,et al.  Synthesis of asynchronous state machines using a local clock , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[7]  Tam-Anh Chu,et al.  Synthesis of hazard-free control circuits from asynchronous finite state machines specifications , 1994, J. VLSI Signal Process..

[8]  Alain J. Martin.  The Design of a Self-timed Circuit for Distributed Mutual Exclusion , 1983 .

[9]  Teresa H. Y. Meng,et al.  Automatic synthesis of asynchronous circuits from high-level specifications , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Kenneth S. Stevens,et al.  The Post Office-Communication Support for Distributed Ensemble Architectures , 1986, IEEE International Conference on Distributed Computing Systems.

[11]  Tam Anh Chu,et al.  An Efficient Critical Race-Free State Assignment Technique for Asynchronous Finite State Machines , 1993, 30th ACM/IEEE Design Automation Conference.

[12]  Douglas B. Armstrong,et al.  Design of Asynchronous Circuits Assuming Unbounded Gate Delays , 1969, IEEE Transactions on Computers.

[13]  Robert K. Brayton,et al.  Synthesis of hazard-free asynchronous circuits from graphical specifications , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.