Improved Decomposition of STGs

Petri Nets and Other Models of Concurrency – ICATPN 2007

Section: Resultsmentioning

confidence: 99%

“…It is shown in [VW02,VK05] that secure contractions of λ-labelled transitions preserve the language of the STG.…”

Section: Stg Decompositionmentioning

confidence: 99%

“…In this section, the STG decomposition algorithm of [VW02,VK05] is outlined, in order to understand the new contributions properly.…”

Section: Stg Decompositionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Combining Decomposition and Unfolding for STG Synthesis

Khomenko

Petri Nets and Other Models of Concurrency – ICATPN 2007

Component Refinement and CSC Solving for STG Decomposition

Foundations of Software Science and Computational Structures

Vogler

2005

Abstract. 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.

Component refinement and CSC-solving for STG decomposition

Theoretical Computer Science

Vogler

2007

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.Here 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 hierarchical decomposition is proven correct. Based on this, it is shown that speed-independent CSC-solving preserves correctness and can be combined with decomposition.Furthermore, we use our new correctness definition to give the first correctness proof for the decomposition method of Carmona and Cortadella. Finally, we compare three different implementation relations for STGs: one derived from our correctness definition; one defined by Dill based on trace structures; and one derived from I/O-compatibility defined by Carmona and Cortadella.