|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
https://hdl.handle.net/10119/12784
|
| Title: | Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata |
| Authors: | Cai, Xiaojuan
Ogawa, Mizuhito |
| Keywords: | Timed Pushdown Automaton
Reachability
Decidability
Well structured pushdown systems |
| Issue Date: | 2014-06 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 8475 |
| Start page: | 336 |
| End page: | 352 |
| DOI: | 10.1007/978-3-319-07151-0_21 |
| 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. |
| Rights: | This is the author-created version of Springer, Xiaojuan Cai and Mizuhito Ogawa, Lecture Notes in Computer Science, 8475, 2014, 336-352. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-319-07151-0_21 |
| URI: | https://hdl.handle.net/10119/12784 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 20620.pdf | | 676Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
