|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b30. リサーチレポート >
Research Report - School of Information Science ： ISSN 0918-7553 >
IS-RR-2013 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/11347
|
| タイトル: | Well-Structured Pushdown Systems, Part 1: Decidable Classes for Coverability |
| 著者: | Cai, Xiaojuan
Ogawa, Mizuhito |
| 発行日: | 2013-01-08 |
| 出版者: | 北陸先端科学技術大学院大学情報科学研究科 |
| 誌名: | Research report (School of Information Science, Japan Advanced Institute of Science and Technology) |
| 巻: | IS-RR-2013-001 |
| 開始ページ: | 1 |
| 終了ページ: | 19 |
| 抄録: | Pushdown systems (PDSs) nicely model single-thread recursive programs, and well-structured transition systems (WSTS), such as vector addition systems, are useful to represent non-recursive multithread programs. Our goal is to investigate well-structured pushdown systems (WSPDSs), pushdown systems with well-quasi-ordered control states and stack alphabet, to combine these ideas. This paper focuses on decidable classes of coverability and extends Pautomata techniques for configuration reachability of PDSs to those for coverability of WSPDSs, in forward and backward ways. A Post^*-automata (resp. Pre^*-automata) construction is combined with Karp-Miller acceleration (resp. ideal representation) to characterize the set of successors (resp. predecessors) of given configurations. We show decidability results of coverability, which include recursive vector addition system with states [1], multi-set pushdown systems [2, 3], and a WSPDS with finite control states and well-quasi-ordered stack alphabet. |
| URI: | http://hdl.handle.net/10119/11347 |
| 資料タイプ: | publisher |
| 出現コレクション: | IS-RR-2013
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| IS-RR-2013-001.pdf | | 877Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
