Zenoness for Timed Pushdown Automata

Parosh Aziz Abdulla
(Uppsala University)
Mohamed Faouzi Atig
(Uppsala University)
Jari Stenman
(Uppsala University)

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.

In Lukas Holik and Lorenzo Clemente: Proceedings 15th International Workshop on Verification of Infinite-State Systems (INFINITY 2013), Hanoi, Vietnam, 14th October 2013, Electronic Proceedings in Theoretical Computer Science 140, pp. 35–47.
Published: 23rd February 2014.

ArXived at: https://dx.doi.org/10.4204/EPTCS.140.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org