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

Comments and questions to:
For website issues: