371 search results - page 3 / 75 » Pushdown Automata Simulator |
73
Voted
JAPLL
2008
14 years 9 months ago
2008
Recently visibly pushdown automata have been extended to so called k-phase multistack visibly pushdown automata (k-MVPAs). On the occasion of introducing kMVPAs, it has been asked...
78
Voted
CAV
2000
Springer
15 years 1 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...
VMCAI
2010
Springer
15 years 6 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
CSR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...