Paper Info
Title
Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata.
Abstract
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 (Well-structured 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.
Year
Venue
DocType
2014
Lecture Notes in Computer Science
Conference
Volume
ISSN
Citations 
8475
0302-9743
5
PageRank 
References 
Authors
0.52
13
2
Name
Order
Citations
PageRank
Xiaojuan Cai1365.95
Mizuhito Ogawa213523.17