Comments and questions to:
eptcs@eptcs.org
|
|
For website issues:
webmaster@eptcs.org
|
|
Parosh Aziz Abdulla (Uppsala University, Sweden) |
Mohamed Faouzi Atig (Uppsala University, Sweden) |
Jari Stenman (Uppsala University, Sweden) |
| 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. |
| ArXived at: https://dx.doi.org/10.4204/EPTCS.103.1 | bibtex | |
|
Comments and questions to:
eptcs@eptcs.org
|
|
For website issues:
webmaster@eptcs.org
|