Reachability in Vector Addition Systems Is Ackermann-Complete.¶

Czerwinski, W., & Orlikowski, L. (2021). Reachability in Vector Addition Systems Is Ackermann-Complete. 62nd IEEE Symposium on Foundations of Computer Science, 1229-1240.

Type: Conference paper
Intellectual base: Primary research
Year: 2021
Pages: 1229-1240
DOI: 10.1109/focs52979.2021.00120
DOI registrant: Institute of Electrical and Electronics Engineers
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¶

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:59be198b739e · see in the full table