113 search results - page 1 / 23 » 2-Visibly Pushdown Automata |
DLT
2007
13 years 6 months ago
2007
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the input. In this paper, we consider VPA with two stacks, namely 2...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We introduce the class of event-clock visibly pushdown automata (ECVPAs) as an extension of event-clock automata. The class of ECVPAs, on one hand, can model simple real-...
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...
FSTTCS
2001
Springer
13 years 9 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...