Structural methods for the synthesis of speed-independent circuits

Most existing tools for the synthesis of asynchronous circuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper presents novel methods exclusively based on the structural analysis of the underlying Petri net. This methodology can be applied to any STG that can be covered by State Machines and, in particular to all live and safe free-choice STGs. Significant improvements with regard to existing structural methods are provided. The new techniques have been implemented in an experimental tool that has been able to synthesize specifications with over 10/sup 27/ markings, some of them being non-free choice.

[1]  Peter A. Beerel,et al.  Automatic gate-level synthesis of speed-independent circuits , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[2]  Jordi Cortadella,et al.  Hierarchical gate-level verification of speed-independent circuits , 1995, Proceedings Second Working Conference on Asynchronous Design Methodologies.

[3]  Alexandre Yakovlev,et al.  On hazard-free implementation of speed-independent circuits , 1995, ASP-DAC '95.

[4]  C. Ykman-Couvreur,et al.  Synthesis and optimization of asynchronous controllers based on extended lock graph theory , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[5]  Javier Esparza,et al.  A polynomial algorithm to compute the concurrency relation of free-choice Signal Transition Graphs , 1995 .

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

[7]  Alexandre Yakovlev,et al.  Signal Graphs: From Self-Timed to Timed Ones , 1985, PNPM.

[8]  Jordi Cortadella,et al.  Polynomial algorithms for the synthesis for hazard-free circuits from signal transition graphs , 1993, ICCAD.

[9]  Enrique Pastor Llorens.  Structural methods for the synthesis of asynchronous circuits from signal transition graphs , 1996 .

[10]  Chen-Shang Lin,et al.  Automatic synthesis of asynchronous circuits , 1991, 28th ACM/IEEE Design Automation Conference.

[11]  Teresa H. Y. Meng,et al.  Automatic synthesis of asynchronous circuits from high-level specifications , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Jordi Cortadella,et al.  A new look at the conditions for the synthesis of speed-independent circuits , 1995, Proceedings. Fifth Great Lakes Symposium on VLSI.

[13]  Frank M. Brown,et al.  Boolean reasoning - the logic of boolean equations , 1990 .

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

[15]  Jordi Cortadella,et al.  Structural methods for the synthesis of speed-independent circuits , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[16]  P. Siegel,et al.  Decomposition Methods For Library Binding Of Speed-independent Asynchronous Designs , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[17]  A. Sangiovanni-Vincentelli,et al.  A unified signal transition graph model for asynchronous control circuit synthesis , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[18]  Kurt Lautenbach.  Linear Algebraic Techniques for Place/Transition Nets , 1986, Advances in Petri Nets.

[19]  Luciano Lavagno,et al.  Decomposition and technology mapping of speed-independent circuits using Boolean relations , 1997, ICCAD 1997.

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

[21]  Peter A. Beerel.  CAD tools for the synthesis, verification, and testability of robust asynchronous circuits , 1995 .

[22]  Jordi Cortadella,et al.  An efficient unique state coding algorithm for signal transition graphs , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

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

[24]  Jordi Cortadella,et al.  Verification of Asynchronous Circuits by BDD-based Model Checking of Petri Nets , 1995, Application and Theory of Petri Nets.

[25]  Teresa H. Y. Meng,et al.  Automatic gate-level synthesis of speed-independent circuits , 1992, ICCAD '92.

[26]  A. J. Martin.  Formal program transformations for VLSI circuit synthesis , 1989 .

[27]  Hugo De Man,et al.  Optimized synthesis of asynchronous control circuits from graph-theoretic specifications , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[28]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[29]  Michael Kishinevsky,et al.  Formal method for self-timed design , 1991, Proceedings of the European Conference on Design Automation..

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

[31]  Alexandre Yakovlev,et al.  Checking signal transition graph implementability by symbolic BDD traversal , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

[32]  Jordi Cortadella,et al.  Polynomial algorithms for the synthesis of hazard-free circuits from signal transition graphs , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

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

[34]  C. Petri.  Kommunikation mit Automaten , 1962 .

[35]  Luciano Lavagno,et al.  A unified signal transition graph model for asynchronous control circuit synthesis , 1992, ICCAD.

[36]  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.

[37]  F. Garcia-Valles,et al.  A Boolean approach to the state machine decomposition of Petri nets with OBDD's , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[38]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[39]  K. Mercierlaan.  Optimized Synthesis of Asynchronous Control Circuits from Graph-t heoretic Specifications. * , 1990 .

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

[41]  Manuel Silva,et al.  A polynomial-time algorithm to decide liveness of bounded free choice nets , 1992 .

[42]  Alexandre Yakovlev,et al.  Basic Gate Implementation of Speed-Independendent Circuits , 1994, 31st Design Automation Conference.

[43]  Manuel Silva Suárez,et al.  A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets , 1992, Theor. Comput. Sci..

[44]  Robert K. Brayton,et al.  Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.