Zenoness for Timed Pushdown Automata
Formal Languages and Automata Theory
2014-02-28 v1
Abstract
Timed pushdown automata are pushdown automata extended with a finite set of real-valued clocks. Additionaly, each symbol in the stack is equipped with a value representing its age. The enabledness of a transition may depend on the values of the clocks and the age of the topmost symbol. Therefore, dense-timed pushdown automata subsume both pushdown automata and timed automata. We have previously shown that the reachability problem for this model is decidable. In this paper, we study the zenoness problem and show that it is EXPTIME-complete.
Keywords
Cite
@article{arxiv.1402.6784,
title = {Zenoness for Timed Pushdown Automata},
author = {Parosh Aziz Abdulla and Mohamed Faouzi Atig and Jari Stenman},
journal= {arXiv preprint arXiv:1402.6784},
year = {2014}
}
Comments
In Proceedings INFINITY 2013, arXiv:1402.6610