The tree width of auxiliary storage
The tree width of auxiliary storage
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.
model checking, automata, decision procedures, bounded tree-width
978-1-4503-0490-0
283-294
Madhusudan, P.
8af89366-038f-4a30-9588-61d3f4477b49
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
2011
Madhusudan, P.
8af89366-038f-4a30-9588-61d3f4477b49
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Madhusudan, P. and Parlato, Gennaro
(2011)
The tree width of auxiliary storage.
POPL '11. Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Austin, United States.
26 - 28 Jan 2011.
.
(doi:10.1145/1925844.1926419).
Record type:
Conference or Workshop Item
(Paper)
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.
Text
graphautomata.pdf
- Version of Record
More information
Published date: 2011
Venue - Dates:
POPL '11. Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Austin, United States, 2011-01-26 - 2011-01-28
Keywords:
model checking, automata, decision procedures, bounded tree-width
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 272444
URI: http://eprints.soton.ac.uk/id/eprint/272444
ISBN: 978-1-4503-0490-0
PURE UUID: f8adee63-0e85-4b55-a10d-0506cc795059
Catalogue record
Date deposited: 13 Jun 2011 12:36
Last modified: 14 Mar 2024 10:01
Export record
Altmetrics
Contributors
Author:
P. Madhusudan
Author:
Gennaro Parlato
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics