Reachability in Vector Addition Systems is Ackermann-complete

Wojciech Czerwinski, Lukasz Orlikowski. Reachability in Vector Addition Systems is Ackermann-complete. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. pages 1229-1240, IEEE, 2021. [doi]

Abstract

Abstract is missing.