|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b30. リサーチレポート >
Research Report - School of Information Science ： ISSN 0918-7553 >
IS-RR-2016 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/13503
|
| タイトル: | Termination and Boundedness for Well-Structured Pushdown Systems |
| 著者: | Lei, Suhua
Cai, Xiaojuan
Ogawa, Mizuhito |
| 発行日: | 2016-05-17 |
| 出版者: | 北陸先端科学技術大学院大学先端科学技術研究科情報科学系 |
| 誌名: | Research report (School of Information Science, Graduate School of Advanced Science and Technology, Japan Advanced Institute of Science and Technology) |
| 巻: | IS-RR-2016-001 |
| 開始ページ: | 1 |
| 終了ページ: | 25 |
| 抄録: | 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 |
| 資料タイプ: | publisher |
| 出現コレクション: | IS-RR-2016
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| IS-RR-2016-001.pdf | | 502Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
