Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki. The reachability problem for Petri nets is not elementary. In Moses Charikar, Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. pages 24-33, ACM, 2019. [doi]
Abstract is missing.