An approach for functional decomposition applied to state-based designs

This paper presents a new approach for functional decomposition of complex systems by applying and enhancing the concepts of clique-decomposition and superstate formation. This approach can be utilized by graphs and state-based software or hardware designs. This method extends the design flow process by automatically extracting states from an existing design and decomposing the states into submodules. The automatic state extraction can be performed either using an original tool or the existing Debussy nState tool. This method has been applied successfully to graphs and state-based Verilog programs, as illustrated by examples in this paper. Furthermore, the complexity analysis shows the underlying algorithm executes well.

[1]  Panos Y. Papalambros,et al.  Hierarchical Decomposition Synthesis in Optimal Systems Design , 1996, DAC 1996.

[2]  Nancy G. Leveson,et al.  Completeness and Consistency in Hierarchical State-Based Requirements , 1996, IEEE Trans. Software Eng..

[3]  Öjvind Johansson,et al.  Graph Decomposition Using Node Labels , 2001 .

[4]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.