A general state graph transformation framework for asynchronous synthesis

A general framework for synthesis of asynchronous con- trol circuits at the state graph level is proposed. The framework can consider both concurrency reduction as well as new state signal in- sertion during the transformation process. Considering concurrency reduction in the exploration space is crucial because more area effi- cient and higher performance circuits may be possible. This is partly because often fewer new state signals are required and the resu lting logic is typically more highly unspecified, thus leaving more room for optimizations at the logic level. Considering new state signal insertion is also crucial as new signals are usually required for dis- ambiguating state coding conflicts. A larger solution space can be searched when both classes of transformations are considered. The new framework has been implemented and verified on a large set of realistic design examples.