Reachability in Vector Addition Systems Is Ackermann-Complete.

Czerwiński, W., & Orlikowski, Ł. (2021). Reachability in Vector Addition Systems Is Ackermann-Complete. 62nd IEEE Symposium on Foundations of Computer Science.

Type

Preprint

Intellectual base

Grey literature

Year

2021

DOI

10.1109/focs52979.2021.00120`

Link

https://arxiv.org/abs/2104.13866

Cited by

1 citation across 1 artifact.

Domain-specific

• Vector Addition System
  • the analysis predicate: reachability, coverability, boundedness, termination, liveness, repeated reachability, or a related property states what part of the graph matters.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:f1508157d40f · see in the full table