|
JAIST Repository >
School of Information Science >
JAIST Research Reports >
Research Report - School of Information Science ： ISSN 0918-7553 >
IS-RR-2016 >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/13503
|
| Title: | Termination and Boundedness for Well-Structured Pushdown Systems |
| Authors: | Lei, Suhua
Cai, Xiaojuan
Ogawa, Mizuhito |
| Issue Date: | 2016-05-17 |
| Publisher: | 北陸先端科学技術大学院大学先端科学技術研究科情報科学系 |
| Magazine name: | Research report (School of Information Science, Graduate School of Advanced Science and Technology, Japan Advanced Institute of Science and Technology) |
| Volume: | IS-RR-2016-001 |
| Start page: | 1 |
| End page: | 25 |
| Abstract: | Well-structured pushdown systems (WSPDSs) extend pushdown systems with well-quasi-ordered (possibly in_nitely many) states and stack alphabet. As an expressive model for concurrent recursive computations, WSPDSs are believed to “be close the border of undecidability” [11]. Most of the decidability results are known only on subclasses. In this paper, we investigate the decidability of the termination and boundedness problems for WSPDSs using two algorithms: One is an extension of the reduced reachability tree technique proposed by Leroux et. al. in [11]. The other is based on Post^*-automata technique which has been successfully applied in the model checking of pushdown systems. The complexity of both are Hyper-Ackermannian for bounded WSPDSs. We implement both algorithms and make experiments on a large number of randomly generated WSPDSs. The results illustrate that the Post^*_automata based algorithm sometimes behaves an order of magnitude faster. |
| URI: | http://hdl.handle.net/10119/13503 |
| Material Type: | publisher |
| Appears in Collections: | IS-RR-2016
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| IS-RR-2016-001.pdf | | 502Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
