Adding Time to Pushdown Automata

@inproceedings{Abdulla2012AddingTT,
  title={Adding Time to Pushdown Automata},
  author={P. Abdulla and M. F. Atig and Jari Stenman},
  booktitle={QFM},
  year={2012}
}
  • P. Abdulla, M. F. Atig, Jari Stenman
  • Published in QFM 2012
  • Computer Science
  • 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

    SHOWING 1-10 OF 12 REFERENCES
    The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
    • 20
    • PDF
    Dense-Timed Pushdown Automata
    • 67
    • PDF
    Reachability Analysis of Pushdown Automata: Application to Model-Checking
    • 691
    • PDF
    Model checking of systems with many identical timed processes
    • 86
    Verifying Networks of Timed Processes (Extended Abstract)
    • 71
    • PDF
    A Theory of Timed Automata
    • 6,887
    • Highly Influential
    • PDF
    Tools and Algorithms for the Construction and Analysis of Systems
    • 1,607
    • PDF
    A theory of timed automata. Theoretical computer science
    • A theory of timed automata. Theoretical computer science
    • 1994
    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