STG Decomposition: Optimised Backtracking and Component Reduction
- The synthesis of asynchronous circuits is a difficult and time-consuming task. Outgoing from a Petri net based behavioural description – signal transition graphs – there exist methods to decompose this description into smaller components in order to improve synthesis. This paper deals with the decomposition method of Vogler, Wollowski and Kangsah and introduces several methods for the improvement of efficiency. These methods are discussed and compared by the means of benchmark examples.
| Author: | Mark SchaeferGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-1972 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/246 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2005-13) |
| Type: | Report |
| Language: | English |
| Year of first Publication: | 2005 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2006/06/19 |
| Tag: | asynchronous circuit; STG; Petri net; decomposition; speed-independent |
| GND-Keyword: | Petri-Netz; Logische Schaltung; Verfeinerung |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
