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/11446

Title: Well-Structured Pushdown Systems, Part 2: On Reachability of Dense Timed Pushdown Automata
Authors: Ogawa, Mizuhito
Cai, Xiaojuan
Issue Date: 2013-08-19
Publisher: 北陸先端科学技術大学院大学情報科学研究科
Magazine name: Research report (School of Information Science, Japan Advanced Institute of Science and Technology)
Volume: IS-RR-2013-005
Start page: 1
End page: 18
Abstract: This paper investigates a general framework of a pushdown system with well-quasi-ordered states and stack alphabet to show decidability of reachability. As an instance, an alternative proof of the decidability of the (configuration) reachability for dense-timed pushdown system (in P.A. Abdulla, M.F. Atig, F. Stenman, Dense-Timed Pushdown Automata, IEEE LICS 2012 ) is presented.
URI: http://hdl.handle.net/10119/11446
Material Type: publisher
Appears in Collections:IS-RR-2013

Files in This Item:

File Description SizeFormat
IS-RR-2013-005.pdf716KbAdobe 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