Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2017.119
URN: urn:nbn:de:0030-drops-74374
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7437/
Figueira, Diego ; Lazic, Ranko ; Leroux, Jérôme ; Mazowiecki, Filip ; Sutre, Grégoire
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One
| pdf-format: |
|
Abstract
Whether the reachability problem for branching vector addition systems, or equivalently the provability problem for multiplicative exponential linear logic, is decidable has been a long-standing open question. The one-dimensional case is a generalisation of the extensively studied one-counter nets, and it was recently established polynomial-time complete provided counter updates are given in unary. Our main contribution is to determine the complexity when the encoding is binary: polynomial-space complete.
BibTeX - Entry
@InProceedings{figueira_et_al:LIPIcs:2017:7437,
author = {Diego Figueira and Ranko Lazic and J{\'e}r{\^o}me Leroux and Filip Mazowiecki and Gr{\'e}goire Sutre},
title = {{Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {119:1--119:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7437},
URN = {urn:nbn:de:0030-drops-74374},
doi = {10.4230/LIPIcs.ICALP.2017.119},
annote = {Keywords: branching vector addition systems, reachability problem}
}
| Keywords: | branching vector addition systems, reachability problem | |
| Seminar: | 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 07.07.2017 |
