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 Jurdzi\'{n}ski 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.
Cite
@article{arxiv.1904.10226,
title = {Reachability for Bounded Branching VASS},
author = {Filip Mazowiecki and Michał Pilipczuk},
journal= {arXiv preprint arXiv:1904.10226},
year = {2019}
}