The reachability problem for branching vector addition systems requires doubly-exponential space

Branching vector addition systems are an extension of vector addition systems where new reachable vectors may be obtained by summing two reachable vectors and adding an integral vector from a fixed finite set. The reachability problem for them is shown hard for doubly-exponential space. For an alternative extension of vector addition systems, where reachable vectors may be combined by subtraction, most decision problems of interest are shown undecidable.

[1]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[2]  Bruno Guillaume,et al.  Vector addition tree automata , 2004, LICS 2004.

[3]  Bruno Guillaume,et al.  Vector addition tree automata , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[4]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

[5]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.

[6]  Jean Goubault-Larrecq,et al.  Karp-Miller Trees for a Branching Extension of VASS , 2005, Discret. Math. Theor. Comput. Sci..

[7]  S. Rao Kosaraju,et al.  Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

[8]  Owen Rambow,et al.  Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations , 1994, ACL.

[9]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[10]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[11]  Jean-Luc Lambert,et al.  A Structure to Decide Reachability in Petri Nets , 1992, Theor. Comput. Sci..

[12]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[13]  Jérôme Leroux.  The General Vector Addition System Reachability Problem by Presburger Inductive Invariants , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[14]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.