5 search results - page 1 / 1 » An Efficient Unique State Coding Algorithm for Signal Transi... |
83
Voted
ICCD
1993
IEEE
15 years 3 months ago
1993
IEEE
83
Voted
ACSD
2003
IEEE
15 years 2 months ago
2003
IEEE
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...
87
Voted
ACSD
2004
IEEE
15 years 2 months ago
2004
IEEE
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 edges of...
90
Voted
ICSE
2010
IEEE-ACM
15 years 25 days ago
2010
IEEE-ACM
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
96
Voted
ICCAD
1999
IEEE
15 years 3 months ago
1999
IEEE
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...