@InProceedings{tredup_et_al:LIPIcs.CONCUR.2018.16,
author = {Tredup, Ronny and Rosenke, Christian},
title = {{Narrowing down the Hardness Barrier of Synthesizing Elementary Net Systems}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {16:1--16:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.16},
URN = {urn:nbn:de:0030-drops-95546},
doi = {10.4230/LIPIcs.CONCUR.2018.16},
annote = {Keywords: Elementary net systems, Petri net synthesis, NP-completeness, Parameterized Complexity}
}