Corpus ID: 233481821

Long Runs Imply Big Separators in Vector Addition Systems

@article{Czerwinski2021LongRI,
  title={Long Runs Imply Big Separators in Vector Addition Systems},
  author={Wojciech Czerwinski and Adam Jedrych},
  journal={ArXiv},
  year={2021},
  volume={abs/2105.00052}
}
Despite a very recent progress which settled the complexity of the reachability problem for Vector Addition Systems with States (VASSes) to be Ackermann-complete we still lack of lot of understanding for that problem. A striking example is the reachability problem for three-dimensional VASSes (3-VASSes): it is only known to be PSpace-hard and not known to be elementary. One possible approach which turned out to be successful for many VASS subclasses is to prove that to check reachability it… Expand

References

SHOWING 1-10 OF 18 REFERENCES
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
Complexity Hierarchies beyond Elementary
Czerwiński, Adam Jędrych; licensed under Creative Commons License CC-BY 4.0 42nd Conference on Very Important Topics (CVIT 2016)
  • Editors: John Q. Open and Joan R. Access; Article No
  • 2016
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete*
Demystifying Reachability in Vector Addition Systems
...
1
2
...