Improved Ackermannian lower bound for the Petri nets reachability problem

DOI10.4230/LIPICS.STACS.2022.46MaRDI QIDQ6490992zbMATH OpenFDO

Authors Sławomir Lasota

Publication date 23 April 2024

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2022.46

zbMATH Keywords

Petri netsreachability problemvector addition systems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(8)

• Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
• Ackermannian completion of separators
• Orbit-finite linear programming
• New lower bounds for reachability in vector addition systems
• The semilinear home-space problem is Ackermann-complete for Petri nets
• On the separability problem of VASS reachability languages
• On the home-space problem for Petri nets and its Ackermannian complexity
• Title not available (Why is no real title available?)

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)