JAIST Repository >
School of Information Science >
JAIST Research Reports >
Research Report - School of Information Science : ISSN 0918-7553 >
IS-RR-2013 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/11347

Title: Well-Structured Pushdown Systems, Part 1: Decidable Classes for Coverability
Authors: Cai, Xiaojuan
Ogawa, Mizuhito
Issue Date: 2013-01-08
Publisher: 北陸先端科学技術大学院大学情報科学研究科
Magazine name: Research report (School of Information Science, Japan Advanced Institute of Science and Technology)
Volume: IS-RR-2013-001
Start page: 1
End page: 19
Abstract: 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
Material Type: publisher
Appears in Collections:IS-RR-2013

Files in This Item:

File Description SizeFormat
IS-RR-2013-001.pdf877KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology