Lazy transition systems: application to timing optimization of asynchronous circuits
Document typeConference report
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
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.
CitationCortadella, J. [et al.]. Lazy transition systems: application to timing optimization of asynchronous circuits. A: IEEE/ACM International Conference on Computer-Aided Design. "1998 InternationaI Conference on Computer-Aided Design: November 8-12, 1998, San Jose, California: digest of technical papers". Institute of Electrical and Electronics Engineers (IEEE), 1998, p. 324-331.