Adding Time to Pushdown Automata

TL;DR

This paper introduces timed pushdown automata by combining pushdown automata with timed automata, and shows how reachability problems for TPDAs can be reduced to those for PDAs.

Contribution

It presents a method to integrate timing into pushdown automata and reduces their reachability problem to classical PDA reachability.

Findings

Timed pushdown automata can be constructed from pushdown automata and timed automata.

Reachability in TPDAs can be reduced to reachability in PDAs.

The tutorial provides illustrative examples of the combined models.

Abstract

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.