56 search results - page 4 / 12 » Efficient Symbolic State-Space Construction for Asynchronous... |
ACSD
2004
IEEE
13 years 9 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...
ARTS
1999
Springer
13 years 10 months ago
1999
Springer
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checkin...
ICCAD
2010
IEEE
13 years 3 months ago
2010
IEEE
Elastic systems, either synchronous or asynchronous, can be optimized for the average-case performance when they have units with early evaluation or variable latency. The performan...
LICS
2006
IEEE
13 years 11 months ago
2006
IEEE
Automata on infinite objects are extensively used in system specification, verification, and synthesis. While some applications of the automata-theoretic approach have been wel...
SPIN
2010
Springer
13 years 4 months ago
2010
Springer
In this paper, we propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequence...