Zenoness for Timed Pushdown Automata

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

Full description

Bibliographic Details
Main Authors: Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman
Format: Article
Language:English
Published: Open Publishing Association 2014-02-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1402.6784v1