Reachability in Vector Addition Systems is Ackermann-complete-Reference-Cited by-同舟云学术

Reachability in Vector Addition Systems is Ackermann-complete

Published:2022-02 Issue: Volume: Page:
ISSN:
Container-title:2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Czerwinski Wojciech¹,Orlikowski Lukasz¹

Affiliation:

1. University of Warsaw

Publisher

IEEE

Link

Reference20 articles.

3. Improved Ackermannian lower bound for the VASS reachability problem;lasota;CoRR,2021

4. The reachability problem for Petri nets is not primitive recursive;leroux;Proceedings of FOCS 2021,2021

5. The reachability problem for Petri nets is not primitive recursive;leroux;CoRR,2021

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

3. On the Separability Problem of VASS Reachability Languages;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

4. Decidability and Complexity of Decision Problems for Affine Continuous VASS;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

5. Soundness of reset workflow nets;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08