The tree width of auxiliary storage


Madhusudan, P. and Parlato, Gennaro (2011) The tree width of auxiliary storage At POPL '11. Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, United States. 26 - 28 Jan 2011. , pp. 283-294. (doi:10.1145/1925844.1926419).

Download

[img] PDF graphautomata.pdf - Version of Record
Download (239kB)

Description/Abstract

We propose a generalization of results on the decidability of emptiness for several restricted classes of sequential and distributed automata with auxiliary storage (stacks, queues) that have recently been proved. Our generalization relies on reducing emptiness of these automata to finite-state graph automata (without storage) restricted to monadic second-order (MSO) definable graphs of bounded tree-width, where the graph structure encodes the mechanism provided by the auxiliary storage. Our results outline a uniform mechanism to derive emptiness algorithms for automata, explaining and simplifying several existing results, as well as proving new decidability results.

Item Type: Conference or Workshop Item (Paper)
Digital Object Identifier (DOI): doi:10.1145/1925844.1926419
Venue - Dates: POPL '11. Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, United States, 2011-01-26 - 2011-01-28
Keywords: model checking, automata, decision procedures, bounded tree-width
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Organisations: Electronic & Software Systems
ePrint ID: 272444
Date :
Date Event
2011Published
Date Deposited: 13 Jun 2011 12:36
Last Modified: 17 Apr 2017 17:44
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/272444

Actions (login required)

View Item View Item