Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings

A combined framework for the resolution of encoding conflicts in STG unfoldings is presented, which extends previous work by incorporating concurrency reduction in addition to signal insertion. Furthermore, a novel validity condition is proposed to justify these transformations. The method has been implemented in the CONFRES tool and applied to a number of case studies. The experimental results show that the combined framework enlarges the design space and allows better exploration of the speed/area tradeoff

[1]  Luciano Lavagno,et al.  Petrify: A Tool for Manipulating Concurrent Specifications and Synthesis of Asynchronous Controllers (Special Issue on Asynchronous Circuit and System Design) , 1997 .

[2]  Maciej Koutny,et al.  Detecting state coding conflicts in STG unfoldings using SAT , 2003, Third International Conference on Application of Concurrency to System Design, 2003. Proceedings..

[3]  電子情報通信学会.  IEICE transactions on information and systems , 1992 .

[4]  Maciej Koutny,et al.  Detecting state coding conflicts in STGs using integer programming , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[5]  Joost Engelfriet,et al.  Branching processes of Petri nets , 1991, Acta Informatica.

[6]  Maciej Koutny,et al.  Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT , 2006, Fundam. Informaticae.

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

[8]  Chantal Ykman-Couvreur,et al.  A general state graph transformation framework for asynchronous synthesis , 1994, EURO-DAC '94.

[9]  Tom Verhoeff,et al.  Analyzing specifications for delay-insensitive circuits , 1998, Proceedings Fourth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

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

[11]  Mark B. Josephs,et al.  An analysis of determinacy using a trace-theoretic model of asynchronous circuits , 2003, Ninth International Symposium on Asynchronous Circuits and Systems, 2003. Proceedings..

[12]  Alexandre Yakovlev,et al.  Visualization and resolution of coding conflicts in asynchronous circuit design , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[13]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 1996, Formal Methods Syst. Des..

[14]  Alex Yakovlev,et al.  Visualisation and resolution of encoding conflicts in asynchronous circuit design , 2003 .

[15]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

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

[17]  Victor Khomenko,et al.  Model checking based on prefixes of petri net unfoldings , 2003 .

[18]  Alexandre Yakovlev,et al.  Towards asynchronous A-D conversion , 1998, Proceedings Fourth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[19]  Luciano Lavagno,et al.  What is the cost of delay insensitivity? , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

[20]  Alexei Semenov.  Verification and synthesis of asynchronous control circuits using petri net unfoldings , 1997 .

[21]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[22]  Victor Khomenko,et al.  Behaviour-Preserving Transition Insertions in Unfolding Prefixes , 2007, ICATPN.

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

[24]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

[25]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 2002, Formal Methods Syst. Des..

[26]  Josep Carmona,et al.  A structural encoding technique for the synthesis of asynchronous circuits , 2001, Proceedings Second International Conference on Application of Concurrency to System Design.

[27]  David L. Dill,et al.  Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.

[28]  Walter Vogler,et al.  Component Refinement and CSC Solving for STG Decomposition , 2005, FoSSaCS.

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