@inproceedings{leroux:LIPIcs:2019:10949,
Address = {Dagstuhl, Germany},
Annote = {Keywords: Petri net, Reachability problem, Formal verification, Concurrency},
Author = {Leroux, J{\'e}r{\^o}me},
BookTitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
Editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter},
File = {Petri Net Reachability Problem (Invited Talk) - LIPIcs-MFCS-2019-5 (0) - a - a - i.pdf},
ISBN = {978-3-95977-117-7},
ISSN = {1868-8969},
Pages = {5:1--5:3},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Petri Net Reachability Problem (Invited Talk)}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10949},
Volume = {138},
Year = {2019},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2019/10949},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.MFCS.2019.5},
date-added = {2019-08-26 09:51:35 +0200},
date-modified = {2019-08-26 09:51:35 +0200},
urn = {urn:nbn:de:0030-drops-109493},
doi = {10.4230/LIPIcs.MFCS.2019.5}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A