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. 

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

A Theory of Timed Automata

  • Theor. Comput. Sci.
  • 1992
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Dense-Timed Pushdown Automata

  • 2012 27th Annual IEEE Symposium on Logic in Computer Science
  • 2012
VIEW 4 EXCERPTS

Verifying networks of timed processes. Tools and Algorithms for the Construction and Analysis of Systems, pages

P. A. Abdulla, B. Jonsson
  • 1998
VIEW 1 EXCERPT