70 search results - page 1 / 14 » Reachability Analysis of Pushdown Automata: Application to M... |
CONCUR
1997
Springer
13 years 8 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
FOSSACS
2007
Springer
13 years 10 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
CAV
2000
Springer
13 years 9 months ago
2000
Springer
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automa...
LICS
2006
IEEE
13 years 10 months ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...