The Reachability Problem for Petri Nets Is Not Elementary
From MaRDI portal
Publication:5056399
DOI10.1145/3422822zbMath1499.68222MaRDI QIDQ5056399
Jérôme Leroux, Filip Mazowiecki, Wojciech Czerwiński, Ranko Lazić, Sławomir Lasota
Publication date: 8 December 2022
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3422822
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Lower bounds on the state complexity of population protocols, Multiparty half-duplex systems and synchronous communications, Population protocols: beyond runtime analysis