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

Authors:
Ranko Lazić
Affiliations:
DIMAP, Department of Computer Science, University of Warwick, UK
Venue:
Information Processing Letters
Year:
2010

Citing 9
Cited 1

Petri nets: an introduction

Petri nets: an introduction
A structure to decide reachability in Petri nets

Theoretical Computer Science
Decidability and Complexity of Petri Net Problems - An Introduction

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Multiset-valued linear index grammars: imposing dominance constraints on derivations

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Vector Addition Tree Automata

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Two-variable logic on data trees and XML reasoning

Journal of the ACM (JACM)
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants

LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Parallel program schemata

Journal of Computer and System Sciences

The covering and boundedness problems for branching vector addition systems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.