Adding Time to Pushdown Automata

Adding Time to Pushdown Automata

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2012-12
Hauptverfasser: Parosh Aziz Abdulla, Atig, Mohamed Faouzi, Stenman, Jari
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Formal Languages and Automata Theory
Computer Science - Logic in Computer Science
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422
DOI:10.48550/arxiv.1212.3871