@InProceedings{lasota:LIPIcs.STACS.2022.46,
author = {Lasota, S{\l}awomir},
title = {{Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem}},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)},
pages = {46:1--46:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-222-8},
ISSN = {1868-8969},
year = {2022},
volume = {219},
editor = {Berenbrink, Petra and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.46},
URN = {urn:nbn:de:0030-drops-158561},
doi = {10.4230/LIPIcs.STACS.2022.46},
annote = {Keywords: Petri nets, reachability problem, vector addition systems}
}