Improved Ackermannian lower bound for the Petri nets reachability problem

DOI10.4230/LIPICS.STACS.2022.46MaRDI QIDQ6490992FDOQ6490992

Authors: Sławomir Lasota 

Publication date: 23 April 2024

zbMATH Keywords

Petri netsreachability problemvector addition systems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (2)

• Ackermannian completion of separators
• Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy

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)