@inproceedings{raskin_et_al:LIPIcs:2020:12857,
Address = {Dagstuhl, Germany},
Annote = {Keywords: Petri Nets, Reachability Analysis, Parameterized Verification, Flattability},
Author = {Raskin, Mikhail and Weil-Kennedy, Chana and Esparza, Javier},
BookTitle = {31st International Conference on Concurrency Theory (CONCUR 2020)},
Editor = {Konnov, Igor and Kov{\'a}cs, Laura},
File = {Flatness and Complexity of Immediate Observation Petri Nets - LIPIcs-CONCUR-2020-45 - a - q.pdf},
ISBN = {978-3-95977-160-3},
ISSN = {1868-8969},
Pages = {45:1--45:19},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Flatness and Complexity of Immediate Observation Petri Nets}},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12857},
Volume = {171},
Year = {2020},
bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2020/12857},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.45},
date-added = {2020-10-11 12:37:55 +0200},
date-modified = {2020-10-11 12:37:55 +0200},
urn = {urn:nbn:de:0030-drops-128574},
doi = {10.4230/LIPIcs.CONCUR.2020.45}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A