Sciweavers

526 search results - page 1 / 106
» Improved Decomposition of STGs
Sort
View
ACSD
2005
IEEE
90views Hardware» more  ACSD 2005»
14 years 4 months ago
Improved Decomposition of STGs
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...
Walter Vogler, Ben Kangsah
APN
2005
Springer
14 years 4 months ago
Determinate STG Decomposition of Marked Graphs
STGs 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 nondet...
Mark Schäfer, Walter Vogler, Petr Jancar
ACSD
2007
IEEE
103views Hardware» more  ACSD 2007»
14 years 5 months ago
Output-Determinacy and Asynchronous Circuit Synthesis
Signal Transition Graphs (STG) are a formalism for the description of asynchronous circuit behaviour. In this paper we propose (and justify) a formal semantics of nondeterministic...
Victor Khomenko, Mark Schäfer, Walter Vogler
MM
2009
ACM
220views Multimedia» more  MM 2009»
14 years 3 months ago
Multi-modal scene segmentation using scene transition graphs
In this work the problem of automatic decomposition of video into elementary semantic units, known in the literature as scenes, is addressed. Two multi-modal automatic scene segme...
Panagiotis Sidiropoulos, Vasileios Mezaris, Ioanni...
TCAD
1998
82views more  TCAD 1998»
13 years 10 months ago
Structural methods for the synthesis of speed-independent circuits
Most existing tools for the synthesisof asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper ...
Enric Pastor, Jordi Cortadella, Alex Kondratyev, O...