Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata [chapter]

Xiaojuan Cai, Mizuhito Ogawa
2014 Lecture Notes in Computer Science  
This paper investigates a general framework of a pushdown system with well-quasi-ordered states and stack alphabet to show decidability of reachability, which is an extension of our earlier work (Wellstructured Pushdown Systems, CONCUR 2013). As an instance, an alternative proof of the decidability of the reachability for dense-timed pushdown system (in P.A. Abdulla, M.F. Atig, F. Stenman, Dense-Timed Pushdown Automata, IEEE LICS 2012 ) is presented. Our proof would be more robust for extensions, e.g., regular valuations with time.
doi:10.1007/978-3-319-07151-0_21 fatcat:mg3pkutpxrhh3jnl6pqmm34ilm