Improved Ackermannian lower bound for the Petri nets reachability problem
From MaRDI portal
Publication:6490992
DOI10.4230/LIPICS.STACS.2022.46MaRDI QIDQ6490992
Publication date: 23 April 2024
Related Items (2)
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy ⋮ Ackermannian completion of separators
This page was built for publication: Improved Ackermannian lower bound for the Petri nets reachability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6490992)