DocumentCode :
1995894
Title :
Improved decomposition of STGs
Author :
Vogler, W. ; Kangsah, B.
Author_Institution :
Inst. fur Informatik, Augsburg Univ., Germany
fYear :
2005
fDate :
7-9 June 2005
Firstpage :
244
Lastpage :
253
Abstract :
Signal transition graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a first step; this leads to a modular implementation, which can support circuit synthesis by possibly avoiding state explosion or allowing the use of library elements. In a previous paper, the original method was extended and shown to be much more generally applicable than known before. But further extensions are necessary, and some are presented here, e.g.: to avoid dynamic auto-conflicts, the previous paper insisted on avoiding structural auto-conflicts, which is too restrictive; we show how to work with the latter type of auto-conflicts. This and another simple extension makes it necessary to restructure presentation and correctness proof of the decomposition algorithm.
Keywords :
Petri nets; asynchronous circuits; formal specification; logic design; network synthesis; state-space methods; Petri nets; asynchronous circuit behaviour; circuit synthesis; correctness proof; decomposition algorithm; dynamic auto-conflicts; signal transition graphs; state explosion; structural auto-conflicts; Asynchronous circuits; Circuit synthesis; Concurrent computing; Explosions; Labeling; Libraries; Petri nets; Signal synthesis; State-space methods;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Application of Concurrency to System Design, 2005. ACSD 2005. Fifth International Conference on
ISSN :
1550-4808
Print_ISBN :
0-7695-2363-3
Type :
conf
DOI :
10.1109/ACSD.2005.21
Filename :
1508149
Link To Document :
بازگشت