# Adding Time to Pushdown Automata

@inproceedings{Abdulla2012AddingTT, title={Adding Time to Pushdown Automata}, author={Parosh Aziz Abdulla and Mohamed Faouzi Atig and Jari Stenman}, booktitle={QFM}, year={2012} }

In this tutorial, we illustrate through examples how we can combine two classical models, namely those of pushdown automata (PDA) and timed automata, in order to obtain timed pushdown automata (TPDA). Furthermore, we describe how the reachability problem for TPDAs can be reduced to the reachability problem for PDAs.

#### Figures and Topics from this paper

#### References

SHOWING 1-10 OF 12 REFERENCES

The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems

- Mathematics, Computer Science
- LATA
- 2012

This paper introduces the model of priced timed pushdown systems as an extension of discrete-timed push down systems with a cost model that assigns multidimensional costs to both transitions and stack symbols with a minimal cost reachability problem. Expand

Dense-Timed Pushdown Automata

- Mathematics, Computer Science
- 2012 27th Annual IEEE Symposium on Logic in Computer Science
- 2012

The main contribution of the paper is an EXPTIME-complete algorithm for solving the reachability problem for dense-timed pushdown automata. Expand

Reachability Analysis of Pushdown Automata: Application to Model-Checking

- Computer Science
- CONCUR
- 1997

This work considers the more general class of alternating pushdown systems and uses alternating finite-state automata as a representation structure for sets of their configurations and gives a simple and natural procedure to compute sets of predecessors using this representation structure. Expand

Model checking of systems with many identical timed processes

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2003

This work presents a method for deciding reachability properties of networks of timed processes, and shows undecidability of the recurrent state problem: given a state in a timed network, check whether there is a computation of the network visiting the state infinitely often. Expand

Verifying Networks of Timed Processes (Extended Abstract)

- Computer Science
- TACAS
- 1998

This work presents the first decidability result concerning verification of systems that are infinite-state in “two dimensions”: they contain an arbitrary set of (identical) processes, and they use infinite data-structures, viz. real-valued clocks. Expand

A Theory of Timed Automata

- Computer Science
- Theor. Comput. Sci.
- 1994

The main construction of the paper is an (PSPACE) algorithm for checking the emptiness of the language of a (nondeterministic) timed automaton, and it is proved that the universality problem and the language inclusion problem are solvable only for the deterministic automata. Expand

Tools and Algorithms for the Construction and Analysis of Systems

- Computer Science
- Lecture Notes in Computer Science
- 2001

This paper presents a meta-modelling framework for modeling and testing the robustness of the modeled systems and some of the techniques used in this framework have been developed and tested in the field. Expand

Verifying networks of timed processes

- Tools and Algorithms for the Construction and Analysis of Systems
- 1998

Verifying networks of timed processes

- pp. 298–312,
- 1998

Verifying networks of timed processes. Tools and Algorithms for the Construction and Analysis of Systems Adding Time to PDA

- Verifying networks of timed processes. Tools and Algorithms for the Construction and Analysis of Systems Adding Time to PDA
- 1998