Verification for Timed Automata extended with Unbounded Discrete Data Structures

We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack. In this way, we obtain a strong model that may for instance be used to model real-time programs with procedure calls. It is long known that the reachability problem for this model is decidable. The goal of this paper is to identify subclasses of timed pushdown automata for which the language inclusion problem and related problems are decidable

Verification for Timed Automata extended with Unbounded Discrete Data Structures

We study decidability of verification problems for timed automata extendedwith unbounded discrete data structures. More detailed, we extend timedautomata with a pushdown stack. In this way, we obtain a strong model that mayfor instance be used to model real-time programs with procedure calls. It islong known that the reachability problem for this model is decidable. The goalof this paper is to identify subclasses of timed pushdown automata for whichthe language inclusion problem and related problems are decidable