When Reachability Meets Grzegorczyk

DOI10.1145/3373718.3394732zbMath1506.68061OpenAlexW3028690307MaRDI QIDQ5145613

Jérôme Leroux

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3373718.3394732

zbMATH Keywords

verificationPetri netsreachability problemvector addition systemsGrzegorczyk hierarchyAckermannian complexity

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (1)

Flat Petri nets (invited talk)

This page was built for publication: When Reachability Meets Grzegorczyk