The reachability problem for Petri nets is not elementary

Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02390629
Contributor : Jérôme Leroux <>
Submitted on : Tuesday, December 3, 2019 - 11:05:11 AM
Last modification on : Tuesday, February 18, 2020 - 11:12:06 AM

Links full text

Identifiers

Collections

Citation

Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, Filip Mazowiecki. The reachability problem for Petri nets is not elementary. Proceedings of the 51st Annual Symposium on Theory of Computing, 2019, Phoenix, AZ, USA, June 23-26, 2019, Jun 2019, Phoenix, United States. pp.24-33, ⟨10.1145/3313276.3316369⟩. ⟨hal-02390629⟩

Share

Metrics

Record views

12