The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A partial solution to the reachability-problem for vector-addition systems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An algorithm for the general Petri net reachability problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Computing communication cost by Petri nets for hardware/software codesign
RSP '97 Proceedings of the 8th International Workshop on Rapid System Prototyping (RSP '97) Shortening the Path from Specification to Prototype
Alternating two-way AC-tree automata
Information and Computation
Data & Knowledge Engineering
Vector addition system reachability problem: a short self-contained proof
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Vector addition system reachability problem: a short self contained proof
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Vector addition system reversible reachability problem
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Presburger Vector Addition Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Let V be a finite set of integral vectors in Euclidian N-space, and let &abarbelow; be an integral point in the first orthant of N-space. The reachability set R(&abarbelow;,V) is the set of integral points &bbarbelow; in the first orthant such that there is a polygonal path &ggr; from &abarbelow; to &bbarbelow; satisfying (i) all of &ggr; lies in the first orthant, and (ii) the edges of &ggr; are translates of the vectors in V. The reachability problem for the vector addition system (&abarbelow;,V) asks for an algorithm to decide which integral points &bbarbelow; are in R(&abarbelow;,V). In this paper we give an algorithm to solve this problem.