Lazy transition systems: application to timing optimization of asynchronous circuits

The paper introduces Lazy Transitions Systems (LzTSs). The notion of laziness explicitly distinguishes between the enabling and the firing of an event in a transition system. LzTSs can be effectively used to model the behavior of asynchronous circuits in which relative timing assumptions can be made on the occurrence of events. These assumptions can be derived from the information known a priori about the delay of the environment and the timing characteristics of the gates that will implement the circuit. The paper presents necessary conditions to synthesize circuits with a correct behavior under the given timing assumptions. Preliminary results show that significant area and performance improvements can be obtained by exploiting the extra "don't care" space implicitly provided by the laziness of the events.

[1]  Steven M. Nowick,et al.  Automatic synthesis of burst-mode asynchronous controllers , 1993 .

[2]  Kenneth L. McMillan,et al.  Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.

[3]  Michael Kishinevsky,et al.  Concurrent hardware : the theory and practice of self-timed design , 1993 .

[4]  Chris J. Myers,et al.  Automatic Verification of Timed Circuits , 1994, CAV.

[5]  Chris J. Myers,et al.  Computer-aided synthesis and verification of gate-level timed circuits , 1996 .

[6]  Alain J. Martin.  Programming in VLSI: from communicating processes to delay-insensitive circuits , 1991 .

[7]  Steven M. Burns,et al.  Bounded delay timing analysis of a class of CSP programs with choice , 1994, Proceedings of 1994 IEEE Symposium on Advanced Research in Asynchronous Circuits and Systems.

[8]  David L. Dill,et al.  Synthesis of Asynchronous Controllers for Heterogeneous Systems , 1994 .

[9]  Luciano Lavagno,et al.  Decomposition and technology mapping of speed-independent circuits using Boolean relations , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[10]  Chris J. Myers,et al.  Automatic Synthesis and Verification of Gate-Level Timed Circuits , 1994 .

[11]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[12]  Kees van Berkel.  Beware the isochronic fork , 1992, Integr..

[13]  Teresa H. Y. Meng,et al.  Synthesis of Timed Asynchronous CircuitsChris , 1993 .

[14]  Luciano Lavagno,et al.  Petrify: A Tool for Manipulating Concurrent Specifications and Synthesis of Asynchronous Controllers (Special Issue on Asynchronous Circuit and System Design) , 1997 .

[15]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[16]  David L. Dill,et al.  Algorithms for interface timing verification , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[17]  Luciano Lavagno,et al.  Algorithms for Synthesis and Testing of Asynchronous Circuits , 1993 .

[18]  Bill Lin,et al.  Modeling and synthesis of timed asynchronous circuits , 1994, EURO-DAC '94.

[19]  Theodore M. Booth.  Demonstrating hazards in sequential relay circuits , 1963, SWCT.

[20]  Stephen H. Unger,et al.  Asynchronous sequential switching circuits , 1969 .

[21]  Steven M. Burns,et al.  General conditions for the decomposition of state holding elements , 1996, Proceedings Second International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[22]  Ganesh Gopalakrishnan,et al.  Performance analysis and optimization of asynchronous circuits , 1994, Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[23]  Hugo De Man,et al.  Assassin: a synthesis system for asynchronous control circuits , 1994 .