Lazy transition systems: application to timing optimization of asynchronous circuits

This 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 necessaryconditions to synthesize circuits with a correct behavior under the given timing assumptions. Preliminary results show that significantarea and performance improvements can be obtainedby exploiting the extra "don'tcare" space implicitly provided by the laziness of the events.

• Type: Conference
• Year: 1998
• Where: ICCAD
• Authors: Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, Alexander Taubin, Alexandre Yakovlev
• Keywords: Hardware, ICCAD 1998, Lazy Transitions Systems, Relative Timing Assumptions, Timing Assumptions