License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2019.28
URN: urn:nbn:de:0030-drops-109303
URL: http://drops.dagstuhl.de/opus/volltexte/2019/10930/
Go to the corresponding LIPIcs Volume Portal


Mazowiecki, Filip ; Pilipczuk, Michal

Reachability for Bounded Branching VASS

pdf-format:
LIPIcs-CONCUR-2019-28.pdf (0.7 MB)


Abstract

In this paper we consider the reachability problem for bounded branching VASS. Bounded VASS are a variant of the classic VASS model where all values in all configurations are upper bounded by a fixed natural number, encoded in binary in the input. This model gained a lot of attention in 2012 when Haase et al. showed its connections with timed automata. Later in 2013 Fearnley and Jurdzinski proved that the reachability problem in this model is PSPACE-complete even in dimension 1. Here, we investigate the complexity of the reachability problem when the model is extended with branching transitions, and we prove that the problem is EXPTIME-complete when the dimension is 2 or larger.

BibTeX - Entry

@InProceedings{mazowiecki_et_al:LIPIcs:2019:10930,
  author =	{Filip Mazowiecki and Michal Pilipczuk},
  title =	{{Reachability for Bounded Branching VASS}},
  booktitle =	{30th International Conference on Concurrency Theory (CONCUR 2019)},
  pages =	{28:1--28:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-121-4},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{140},
  editor =	{Wan Fokkink and Rob van Glabbeek},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10930},
  URN =		{urn:nbn:de:0030-drops-109303},
  doi =		{10.4230/LIPIcs.CONCUR.2019.28},
  annote =	{Keywords: Branching VASS, counter machines, reachability problem, bobrvass}
}

Keywords: Branching VASS, counter machines, reachability problem, bobrvass
Seminar: 30th International Conference on Concurrency Theory (CONCUR 2019)
Issue Date: 2019
Date of publication: 26.08.2019


DROPS-Home | Imprint | Privacy Published by LZI