@book(DBLP:books/daglib/0027363, author = {Wil M. P. van der Aalst}, year = {2011}, title = {Process Mining - Discovery, Conformance and Enhancement of Business Processes}, publisher = {Springer}, doi = {10.1007/978-3-642-19345-3}, ) @article(DBLP:journals/tcs/BadouelBD97, author = {Eric Badouel and Luca Bernardinello and Philippe Darondeau}, year = {1997}, title = {The Synthesis Problem for Elementary Net Systems is NP-Complete}, journal = {Theor. Comput. Sci.}, volume = {186}, number = {1-2}, pages = {107--134}, doi = {10.1016/S0304-3975(96)00219-8}, ) @book(DBLP:series/txtcs/BadouelBD15, author = {Eric Badouel and Luca Bernardinello and Philippe Darondeau}, year = {2015}, title = {Petri Net Synthesis}, series = {Texts in Theoretical Computer Science. An {EATCS} Series}, publisher = {Springer}, doi = {10.1007/978-3-662-47967-4}, ) @article(DBLP:journals/fac/BadouelCD02, author = {Eric Badouel and Beno{\^{\i}}t Caillaud and Philippe Darondeau}, year = {2002}, title = {Distributing Finite Automata Through Petri Net Synthesis}, journal = {Formal Asp. Comput.}, volume = {13}, number = {6}, pages = {447--470}, doi = {10.1007/s001650200022}, ) @article(DBLP:journals/acta/BadouelD95, author = {Eric Badouel and Philippe Darondeau}, year = {1995}, title = {Trace Nets and Process Automata}, journal = {Acta Inf.}, volume = {32}, number = {7}, pages = {647--679}, doi = {10.1007/BF01186645}, ) @inproceedings(DBLP:conf/ac/Best86a, author = {Eike Best}, year = {1986}, title = {Structure Theory of Petri Nets: the Free Choice Hiatus}, booktitle = {Advances in Petri Nets}, series = {Lecture Notes in Computer Science}, volume = {254}, publisher = {Springer}, pages = {168--205}, doi = {10.1007/BFb0046840}, ) @article(DBLP:journals/acta/BestDS18, author = {Eike Best and Raymond R. Devillers and Uli Schlachter}, year = {2018}, title = {Bounded choice-free Petri net synthesis: algorithmic issues}, journal = {Acta Inf.}, volume = {55}, number = {7}, pages = {575--611}, doi = {10.1007/s00236-017-0310-9}, ) @article(DBLP:journals/tcad/CortadellaKKLY97, author = {Jordi Cortadella and Michael Kishinevsky and Alex Kondratyev and Luciano Lavagno and Alexandre Yakovlev}, year = {1997}, title = {A region-based theory for state assignment in speed-independent circuits}, journal = {{IEEE} Trans. on {CAD} of Integrated Circuits and Systems}, volume = {16}, number = {8}, pages = {793--812}, doi = {10.1109/43.644602}, ) @book(DBLP:books/sp/CyganFKLMPPS15, author = {Marek Cygan and Fedor V. Fomin and Lukasz Kowalik and Daniel Lokshtanov and D{\'{a}}niel Marx and Marcin Pilipczuk and Michal Pilipczuk and Saket Saurabh}, year = {2015}, title = {Parameterized Algorithms}, publisher = {Springer}, doi = {10.1007/978-3-319-21275-3}, ) @inproceedings(DBLP:conf/apn/DevillersEH19, author = {Raymond R. Devillers and Evgeny Erofeev and Thomas Hujsa}, year = {2019}, title = {Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems}, editor = {Wil M. P. van der Aalst and Robin Bergenthum and Josep Carmona}, booktitle = {ATAED@Petri Nets/ACSD 2019, Aachen, Germany, June 25, 2019}, series = {{CEUR} Workshop Proceedings}, volume = {2371}, publisher = {CEUR-WS.org}, pages = {6--22}, url = {http://ceur-ws.org/Vol-2371/ATAED2019-6-22.pdf}, ) @article(DBLP:journals/fuin/DevillersH19, author = {Raymond R. Devillers and Thomas Hujsa}, year = {2019}, title = {Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods}, journal = {Fundam. Inform.}, volume = {169}, number = {1-2}, pages = {1--30}, doi = {10.3233/FI-2019-1837}, ) @article(DBLP:journals/eatcs/EsparzaN94, author = {Javier Esparza and Mogens Nielsen}, year = {1994}, title = {Decidability Issues for Petri Nets - a survey}, journal = {Bulletin of the {EATCS}}, volume = {52}, pages = {244--262}, ) @article(DBLP:journals/deds/HollowayKG97, author = {Lawrence E. Holloway and Bruce H. Krogh and Alessandro Giua}, year = {1997}, title = {A Survey of Petri Net Methods for Controlled Discrete Event Systems}, journal = {Discrete Event Dynamic Systems}, volume = {7}, number = {2}, pages = {151--190}, doi = {10.1023/A:1008271916548}, ) @inproceedings(DBLP:conf/apn/Pietkiewicz-Koutny97, author = {Pietkiewicz{-}Koutny, Marta}, year = {1997}, title = {Transition Systems of Elementary Net Systems with Inhibitor Arcs}, booktitle = {{ICATPN}}, series = {Lecture Notes in Computer Science}, volume = {1248}, publisher = {Springer}, pages = {310--327}, doi = {10.1007/3-540-63139-9\_43}, ) @book(DBLP:books/daglib/0084790, author = {Wolfgang Reisig}, year = {1992}, title = {A primer in Petri net design}, series = {Springer Compass International}, publisher = {Springer}, doi = {10.1007/978-3-642-75329-9}, ) @inproceedings(DBLP:conf/concur/Schlachter16, author = {Uli Schlachter}, year = {2016}, title = {Bounded {P}etri Net Synthesis from Modal Transition Systems is Undecidable}, editor = {Jos{\'{e}}e Desharnais and Radha Jagadeesan}, booktitle = {27th International Conference on Concurrency Theory, {CONCUR} 2016, August 23-26, 2016, Qu{\'{e}}bec City, Canada}, series = {LIPIcs}, volume = {59}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, pages = {15:1--15:14}, doi = {10.4230/LIPIcs.CONCUR.2016.15}, ) @inproceedings(DBLP:conf/stacs/Schmitt96, author = {Vincent Schmitt}, year = {1996}, title = {Flip-Flop Nets}, booktitle = {{STACS}}, series = {Lecture Notes in Computer Science}, volume = {1046}, publisher = {Springer}, pages = {517--528}, doi = {10.1007/3-540-60922-9\_42}, ) @article(DBLP:journals/networks/Tarjan77, author = {Robert Endre Tarjan}, year = {1977}, title = {Finding optimum branchings}, journal = {Networks}, volume = {7}, number = {1}, pages = {25--35}, doi = {10.1002/net.3230070103}, ) @article(DBLP:journals/corr/abs-1911-05834, author = {Ronny Tredup}, year = {2019}, title = {The Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (Technical Report)}, journal = {CoRR}, volume = {abs/1911.05834}, url = {http://arxiv.org/abs/1911.05834}, ) @inproceedings(DBLP:conf/apn/Tredup19, author = {Ronny Tredup}, year = {2019}, title = {Hardness Results for the Synthesis of b-bounded Petri Nets}, editor = {Susanna Donatelli and Stefan Haar}, booktitle = {Application and Theory of Petri Nets and Concurrency - 40th International Conference, {PETRI} {NETS} 2019, Aachen, Germany, June 23-28, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11522}, publisher = {Springer}, pages = {127--147}, doi = {10.1007/978-3-030-21571-2\_9}, ) @inproceedings(DBLP:conf/rp/Tredup19, author = {Ronny Tredup}, year = {2019}, title = {Synthesis of Structurally Restricted b-bounded Petri Nets: Complexity Results}, editor = {Emmanuel Filiot and Rapha{\"{e}}l M. Jungers and Igor Potapov}, booktitle = {Reachability Problems - 13th International Conference, {RP} 2019, Brussels, Belgium, September 11-13, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11674}, publisher = {Springer}, pages = {202--217}, doi = {10.1007/978-3-030-30806-3\_16}, ) @inproceedings(DBLP:conf/tamc/TE20, author = {Ronny Tredup and Evgeny Erofeev}, year = {2020}, title = {On the Parameterized Complexity of d-Restricted Boolean Net Synthesis}, booktitle = {Theory and Applications of Models of Computation}, series = {Theoretical Computer Science and General Issues}, volume = {12337}, doi = {10.1007/978-3-030-59267-7}, ) @article(DBLP:journals/corr/abs-2007-12372, author = {Ronny Tredup and Evgeny Erofeev}, year = {2020}, title = {On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency (Technical Report)}, journal = {CoRR}, volume = {abs/2007.12372}, url = {https://arxiv.org/abs/2007.12372}, ) @inproceedings(DBLP:conf/concur/TredupR18, author = {Ronny Tredup and Christian Rosenke}, year = {2018}, title = {Narrowing down the Hardness Barrier of Synthesizing Elementary Net Systems}, booktitle = {{CONCUR}}, series = {LIPIcs}, volume = {118}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, pages = {16:1--16:15}, doi = {10.4230/LIPIcs.CONCUR.2018.16}, ) @inproceedings(DBLP:conf/apn/TredupRW18, author = {Ronny Tredup and Christian Rosenke and Karsten Wolf}, year = {2018}, title = {Elementary Net Synthesis Remains NP-Complete Even for Extremely Simple Inputs}, booktitle = {Petri Nets}, series = {Lecture Notes in Computer Science}, volume = {10877}, publisher = {Springer}, pages = {40--59}, doi = {10.1007/978-3-319-91268-4\_3}, ) @article(DBLP:journals/corr/abs-1911-09133, author = {Harro Wimmel}, year = {2019}, title = {Synthesis of Reduced Asymmetric Choice Petri Nets}, journal = {CoRR}, volume = {abs/1911.09133}, url = {http://arxiv.org/abs/1911.09133}, ) @article(DBLP:journals/iandc/Wimmel20, author = {Harro Wimmel}, year = {2020}, title = {Presynthesis of bounded choice-free or fork-attribution nets}, journal = {Inf. Comput.}, volume = {271}, pages = {104482}, doi = {10.1016/j.ic.2019.104482}, )