Sciweavers

64 search results - page 12 / 13
» Output-Determinacy and Asynchronous Circuit Synthesis
Sort
View
ACSD
2005
IEEE
90views Hardware» more  ACSD 2005»
13 years 11 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
CONCUR
2010
Springer
13 years 6 months ago
On the Compositionality of Round Abstraction
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
Dan R. Ghica, Mohamed N. Menaa
ACSD
2003
IEEE
105views Hardware» more  ACSD 2003»
13 years 9 months ago
Detecting State Coding Conflicts in STG Unfoldings Using SAT
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
ACSD
2003
IEEE
91views Hardware» more  ACSD 2003»
13 years 11 months ago
A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
Signal Transition Graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent an...
Javier Esparza
ICCAD
1999
IEEE
80views Hardware» more  ICCAD 1999»
13 years 10 months ago
What is the cost of delay insensitivity?
Deep submicron technology calls for new design techniques, in which wire and gate delays are accounted to have equal or nearly equal effect on circuit behaviour. Asynchronous spee...
Hiroshi Saito, Alex Kondratyev, Jordi Cortadella, ...