STG Decomposition: Partitioning Heuristics

STG decomposition is well-known as a promising approach to tackle complexity issues in logic synthesis of asynchronous circuits. It is guided by a partition of output signals and generates a component STG for each partition member. Using the finest partition - one output per component - the resulting circuits might not be optimal (e.g. in terms of area). We present very efficient heuristics to get partitions leading to improved circuits, as confirmed by experiments.

[1]  Bill Lin,et al.  Control resynthesis for control-dominated asynchronous designs , 1996, Proceedings Second International Symposium on Advanced Research in Asynchronous Circuits and Systems.

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

[3]  Josep Carmona,et al.  Encoding Large Asynchronous Controllers With ILP Techniques , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Walter Vogler,et al.  STG decomposition strategies in combination with unfolding , 2009, Acta Informatica.

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

[6]  Chris J. Myers,et al.  Synthesis of Timed Circuits Based on Decomposition , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Josep Carmona,et al.  Synthesis of asynchronous controllers using integer linear programming , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[9]  Jens Palsberg,et al.  Complexity Results for 1-safe Nets , 1993, FSTTCS.

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

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

[12]  Manuel Silva Suárez,et al.  Linear Algebraic and Linear Programming Techniques for the Analysis of Place or Transition Net Systems , 1996, Petri Nets.

[13]  Walter Vogler,et al.  STG Decomposition: Internal Communication for SI Implementability , 2010, 2010 10th International Conference on Application of Concurrency to System Design.

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

[15]  Mark Schäfer,et al.  DESIJ--Enabling Decomposition-Based Synthesis of Complex Asynchronous Controllers , 2009, 2009 Ninth International Conference on Application of Concurrency to System Design.

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

[17]  Javier Esparza,et al.  Verification of Safety Properties Using Integer Programming: Beyond the State Equation , 2000, Formal Methods Syst. Des..

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