Component Refinement and CSC Solving for STG Decomposition

FOSSACS 2005, Edinburgh, April 2005
Ed.: V. Sassone
Springer 2005, Lect. Notes Comput. Sci. 3441, 348 – 363
Copyright by Springer

STGs (Signal Transition Graphs) give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondeterministic algorithm for decomposing STGs was suggested by Chu and improved by one of the present authors.

We study how CSC solving (which is essential for circuit synthesis) can be combined with decomposition. For this purpose the correctness definition for decomposition is enhanced with internal signals and it is shown that speed-independent CSC solving preserves correctness. The latter uses a more general result about correctness of top-down decomposition. Furthermore, we apply our definition to give the first correctness proof for the decomposition method of Carmona and Cortadella. 

Downloads:

• Component Refinement and CSC Solving for STG Decomposition  -  (fossacs05-13.pdf, 179 KB)

Links:

• SpringerLink