The Reachability Problem for Petri Nets is Not Primitive Recursive-Reference-Cited by-同舟云学术

The Reachability Problem for Petri Nets is Not Primitive Recursive

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:

Leroux Jerome¹

Affiliation:

1. Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800,Talence,France,F-33400

Funder

ANR programme BraVAS

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9719594/9719683/09719763.pdf?arnumber=9719763

Reference21 articles.

1. Reachability in vector addition systems is primitive-recursive in fixed di-mension;leroux;34th Annual ACM/IEEE Symposium on Logic in Computer Science LICS 2019,2019

2. Expo-nential space complete problems for petri nets and commutative semigroups: Preliminary report;cardoza;Pro-ceedings of the 8th Annual ACM Symposium on Theory of Computing,1976

3. The reachability problem for Petri nets is not elementary

4. Reachability in vector addition systems is ackermann-complete;czerwinski;CoRR,2021

5. The Reachability Problem for Vector Addition System with One Zero-Test

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

1. Punctual categoricity and a jump operation in the primitive recursive degrees;Mathematics and Theoretical Computer Science;2024-07-28

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

3. 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

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

5. Liveness and deadlock-freeness verification and enforcement in bounded Petri nets using basis reachability graphs;Automatica;2024-06