Zenoness for Timed Pushdown Automata
2014 (engelsk)Inngår i: Proceedings 15th International Workshop on Verification of Infinite-State Systems, {INFINITY} 2013, Hanoi, Vietnam, 14th October 2013., 2014, s. -47Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]
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.
sted, utgiver, år, opplag, sider
2014. s. -47
Emneord [en]
Timed Systems, Pushdown automata
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
URN: urn:nbn:se:uu:diva-238136DOI: 10.4204/EPTCS.140OAI: oai:DiVA.org:uu-238136DiVA, id: diva2:770101
Konferanse
Infinity 2014
Prosjekter
UPMARC2014-12-092014-12-092014-12-17