2467 search results - page 319 / 494 » Finite State Machines |
189
click to vote
FM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
172
click to vote
ACSD
2004
IEEE
15 years 10 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...
186
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the...
136
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
163
click to vote
ISSTA
2000
ACM
15 years 10 months ago
2000
ACM
ions for concise and precise specification of such control, but balance this with visualization support to help users also obtain intuitive insights. The underlying complexhese con...