文章基本信息

标题：Adding Time to Pushdown Automata
本地全文：下载
作者：Parosh Aziz Abdulla ; Mohamed Faouzi Atig ; Jari Stenman 等
期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2012
卷号：103
页码：1-16
DOI：10.4204/EPTCS.103.1
出版社：Open Publishing Association
摘要：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.