Lazy transition systems and asynchronous circuits synthesis with relative timing assumptions
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
This paper presents a design flow for timed asynchronous circuits. It introduces lazy transitions systems as a new computational model to represent the timing information required for synthesis. The notion of laziness explicitly distinguishes between the enabling and the firing of an event in a transition system. Lazy transition systems 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 the necessary conditions to generate circuits and a synthesis algorithm that exploits the timing assumptions for optimization. It also proposes a method for back-annotation that derives a set of sufficient timing constraints that guarantee the correctness of the circuit.
CitationCortadella, J., Kishinevsky, M., Burns, S., Kondratyev, A., Lavagno, L., Stevens, K., Taubin, A., Yakovlev, A. Lazy transition systems and asynchronous circuits synthesis with relative timing assumptions. "IEEE transactions on computer-aided design of integrated circuits and systems", Febrer 2002, vol. 21, núm. 2, p. 109-130.