Corpus ID: 233423456

Reachability in Vector Addition Systems is Ackermann-complete

@article{Czerwinski2021ReachabilityIV,
  title={Reachability in Vector Addition Systems is Ackermann-complete},
  author={Wojciech Czerwi'nski and Lukasz Orlikowski},
  journal={ArXiv},
  year={2021},
  volume={abs/2104.13866}
}
Vector Addition Systems and equivalent Petri nets are a well established models of concurrency. The central algorithmic problem for Vector Addition Systems with a long research history is the reachability problem asking whether there exists a run from one given configuration to another. We settle its complexity to be Ackermann-complete thus closing the problem open for 45 years. In particular we prove that the problem is Fk-hard for Vector Addition Systems with States in dimension 6k, where Fk… Expand
10 Citations
A Linear-Time Nominal μ-Calculus with Name Allocation
Logics and automata models for languages over infinite alphabets, such as Freeze LTL and register automata, serve the verification of processes or documents with data. They relate tightly toExpand
Improved Ackermannian lower bound for the Petri nets reachability problem
TLDR
This work improves the lower bound for vector addition systems with states in fixed dimension (or, equivalently, Petri nets with fixed number of places), and improves the former construction, making it conceptually simpler and more direct. Expand
Improved Ackermannian lower bound for the VASS reachability problem
TLDR
This draft provides a simplification of the former construction of VASS, thus improving the lower bound for VASS in fixed dimension, and proves Fk-hardness in dimension 6k, and Leroux in dimension 4k + 9, the simplified construction. Expand
Linear equations for unordered data vectors
Following a recently considered generalisation of linear equations to unordereddata vectors and to ordered-data vectors, we perform a further generalisation to k-elementsets-of-unordered-dataExpand
Long Runs Imply Big Separators in Vector Addition Systems
TLDR
It is shown that in VASSes fulfilling certain conditions existence of only long runs between some configurations implies existence ofonly big separators between some other configurations, and it is proved that a few known examples of hard VASSs fulfil the mentioned conditions. Expand
Nominal Büchi Automata with Name Allocation
TLDR
It is proved that, in contrast to most other nondeterministic automata models over infinite alphabets, language inclusion of Büchi RNNAs is decidable and in fact elementary, which makes B Müchi RnnAs a suitable tool for applications in model checking. Expand
Petri Net Invariant Synthesis
TLDR
This work formulated a CEGAR-loop, an algorithm that decides whether a given half space is indeed inductive, and implemented it in the tool Inequalizer, showing that it is competitive against state-of-the-art techniques. Expand
Population Protocols: Beyond Runtime Analysis
We survey our recent work on the verification of population protocols and their state complexity.
Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq
TLDR
This work presents an alternate undecidability proof for entailment in (intuitionistic) multiplicative subexponential linear logic (MSELL) and gives an alternate presentation of those two counters machines as sequent rules, where computation is performed by proof-search, and halting reduced to provability. Expand
The Reachability Problem for Petri Nets is Not Primitive Recursive
We provide an Ackermannian complexity lower bound for the reachability problem for checking programs, a model equivalent to Petri nets. Moreover in fixed dimension 2d + 4, we show that the problem isExpand

References

SHOWING 1-10 OF 17 REFERENCES
The Reachability Problem for Petri Nets is Not Primitive Recursive
We provide an Ackermannian complexity lower bound for the reachability problem for checking programs, a model equivalent to Petri nets. Moreover in fixed dimension 2d + 4, we show that the problem isExpand
The reachability problem for Petri nets is not elementary
TLDR
A non-elementary lower bound is established, i.e. that the reachability problem needs a tower of exponentials of time and space, which implies that a plethora of problems from formal languages, logic, concurrent systems, process calculi and other areas, that are known to admit reductions from the Petri nets reachable problem, are also not elementary. Expand
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension
  • Jérôme Leroux, S. Schmitz
  • Mathematics, Computer Science
  • 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2019
TLDR
This work provides significant refinements to the classical decomposition algorithm of Mayr, Kosaraju, and Lambert and to its termination proof, which yield an ACKERMANN upper bound in the general case, and primitive-recursive upper bounds in fixed dimension. Expand
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete*
TLDR
This work answers positively the main question left open by Blondin et al, namely establish that reachability witnesses of pseudo-polynomial length always exist, and shows that when the input vectors are given in unary, the improved guess-and-verify algorithm requires only logarithmic space. Expand
Improved Ackermannian lower bound for the VASS reachability problem
TLDR
This draft provides a simplification of the former construction of VASS, thus improving the lower bound for VASS in fixed dimension, and proves Fk-hardness in dimension 6k, and Leroux in dimension 4k + 9, the simplified construction. Expand
Reachability in vector addition systems is Ackermann-complete
  • CoRR, abs/2104.13866,
  • 2021
Reachability in vector addition systems is Ackermann-complete. CoRR, abs
  • 2021
Reachability in fixed dimension vector addition systems with states
TLDR
This work obtains a family of VASS in dimension 3 whose shortest reachability witnessing runs are exponential, and shows that the reachability problem is NP-hard in dimension 7, and contributes a first construction that distinguishes 3-dimensional flat VASS from 2-dimensional VASS. Expand
Complexity Hierarchies beyond Elementary
TLDR
A hierarchy of fast-growing complexity classes is introduced and its suitability for completeness statements of many nonelementary problems is shown, with complexities ranging from simple towers of exponentials to Ackermannian and beyond. Expand
Demystifying Reachability in Vector Addition Systems
TLDR
This work offers a justification for this decomposition technique, and applies recent results on the complexity of termination thanks to well quasi orders and well orders to obtain a cubic Ackermann upper bound for the decomposition algorithms, thus providing the first known upper bounds for general VAS reach ability. Expand
...
1
2
...