Modeling and synthesis of timed asynchronous circuits

| Most asynchronous compilers do not take into account timing constraints, although these are crucial for industrial interface applications. In this paper we extend the classical signal transition graph model such that timing constraints can be modeled in a concise way. We also propose synthesis algorithms that transform the initial speci cation such that the circuit derived from the transformed speci cation satis es all timing constraints.

[1]  Luciano Lavagno,et al.  Algorithms for synthesis of hazard-free asynchronous circuits , 1991, 28th ACM/IEEE Design Automation Conference.

[2]  Teresa H. Y. Meng,et al.  Synthesis of timed asynchronous circuits , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

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

[4]  Gaetano Borriello.  A New Interface Specification Methodology and , 1988 .

[5]  G. Goossens,et al.  A generalized state assignment theory for transformations on signal transition graphs , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

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

[7]  Hugo De Man,et al.  Optimized synthesis of asynchronous control circuits from graph-theoretic specifications , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

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

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

[10]  G. Goossens,et al.  Specification and analysis of timing constraints in signal transition graphs , 1992, [1992] Proceedings The European Conference on Design Automation.

[11]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .