Dimitrova, R. and Majumdar, R. (2015) Reachability analysis of reversal-bounded automata on series-parallel graphs. In: Esparza, J. and Tronci, E., (eds.) Electronic Proceedings in Theoretical Computer Science. 6th International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2015), 21-22 Sep 2015, Genoa, Italy. Open Publishing Association , pp. 100-114.
Abstract
Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automata, have been successfully used to encode many infinite-state non-regular verification problems. In this paper, we consider a generalization of automata-theoretic infinite-state verification from strings to labeled series-parallel graphs. We define a model of non-deterministic, 2-way, concurrent automata working on series-parallel graphs and communicating through shared registers on the nodes of the graph. We consider the following verification problem: given a family of series-parallel graphs described by a context-free graph transformation system (GTS), and a concurrent automaton over series-parallel graphs, is some graph generated by the GTS accepted by the automaton? The general problem is undecidable already for (one-way) multi-head automata over strings. We show that a bounded version, where the automata make a fixed number of reversals along the graph and use a fixed number of shared registers is decidable, even though there is no bound on the sizes of series-parallel graphs generated by the GTS. Our decidability result is based on establishing that the number of context switches is bounded and on an encoding of the computation of bounded concurrent automata to reduce the emptiness problem to the emptiness problem for pushdown automata.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © 2015 The Author(s). This is an Open Access article distributed under the terms of the Creative Commons Attribution Licence (http://creativecommons.org/licenses/by/3.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 11 Feb 2020 12:53 |
Last Modified: | 11 Feb 2020 13:34 |
Published Version: | https://arxiv.org/html/1509.06858v1 |
Status: | Published online |
Publisher: | Open Publishing Association |
Refereed: | Yes |
Identification Number: | 10.4204/eptcs.193.8 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:156436 |