Avoiding irreducible CSC conflicts by internal communication

Resynthesis of handshake specifications obtained e.g. from BALSA or TANGRAM with speed-independent logic synthesis from STGs is a promising approach. To deal with state-space-explosion, we suggested STG decomposition; a problem is that decomposition can lead to irreducible CSC conflicts. Here, we present a new approach to solve such conflicts by introducing internal communication between the components. We give some first, very encouraging results for very large STGs concerning synthesis time and circuit area.

[1]  Steven M. Nowick,et al.  Applications of asynchronous circuits , 1999, Proc. IEEE.

[2]  Alex Yakovlev,et al.  Clockless circuits and system synthesis , 2005 .

[3]  Walter Vogler,et al.  Improved Decomposition of Signal Transition Graphs , 2007, Fundam. Informaticae.

[4]  Josep Carmona,et al.  State encoding of large asynchronous controllers , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[5]  Walter Vogler,et al.  Component refinement and CSC-solving for STG decomposition , 2007, Theor. Comput. Sci..

[6]  N. Karaki,et al.  A flexible 8b asynchronous microprocessor based on low-temperature poly-silicon TFT technology , 2005, ISSCC. 2005 IEEE International Digest of Technical Papers. Solid-State Circuits Conference, 2005..

[7]  Luciano Lavagno,et al.  Logic Synthesis for Asynchronous Controllers and Interfaces , 2002 .

[8]  Ralf Wollowski,et al.  Decomposition : Avoiding Irreducible CSC Conflicts by Internal Communication , 2007 .

[9]  Ad M. G. Peeters,et al.  An asynchronous low-power 80C51 microcontroller , 1998, Proceedings Fourth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[10]  Mark Schäfer,et al.  Combining Decomposition and Unfolding for STG Synthesis , 2007, ICATPN.

[11]  Ralf Wollowski,et al.  Comprehensive Causal Specification of Asynchronous Controller and Arbiter Behaviour , 2000 .

[12]  Walter Vogler,et al.  Determinate STG Decomposition of Marked Graphs , 2005, ICATPN.

[13]  Doug A. Edwards,et al.  Balsa: An Asynchronous Hardware Synthesis Language , 2002, Comput. J..

[14]  Maciej Koutny,et al.  Logic synthesis for asynchronous circuits based on Petri net unfoldings and incremental SAT , 2004, Proceedings. Fourth International Conference on Application of Concurrency to System Design, 2004. ACSD 2004..

[15]  Walter Vogler,et al.  Decomposition in Asynchronous Circuit Design , 2002, Concurrency and Hardware Design.

[16]  Kees van Berkel,et al.  Handshake Circuits: An Asynchronous Architecture for VLSI Programming , 1993 .

[17]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[18]  D. A. Edwards,et al.  The Balsa Asynchronous Circuit Synthesis System , 2000 .

[19]  Gérard Berthelot,et al.  Transformations and Decompositions of Nets , 1986, Advances in Petri Nets.

[20]  Josep Carmona,et al.  ILP Models for the Synthesis of Asynchronous Control Circuits , 2003, ICCAD 2003.

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

[22]  Steven M. Nowick,et al.  Scanning the Technology Applications of Asynchronous Circuits , 1999 .

[23]  Jo C. Ebergen,et al.  Arbiters: An Exercise in Specifying and Decomposing Asynchronously Communicating Components , 1992, Sci. Comput. Program..

[24]  Walter Vogler,et al.  Avoiding irreducible CSC conflicts by internal communication , 2008, 2008 8th International Conference on Application of Concurrency to System Design.

[25]  Chris J. Myers,et al.  Synthesis of speed independent circuits based on decomposition , 2004, 10th International Symposium on Asynchronous Circuits and Systems, 2004. Proceedings..

[26]  Charles André,et al.  Structural Transformations Giving B-Equivalent PT-Nets , 1982, European Workshop on Applications and Theory of Petri Nets.