@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/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},
)
@misc(jordiCortadella2017,
 author       = {Jordi Cortadella},
 year         = {2017},
 title        = {Private Correspondance},
)
@article(DBLP:journals/acta/KleijnKPR13,
 author       = {Jetty Kleijn and Maciej Koutny and Pietkiewicz{-}Koutny, Marta and Grzegorz Rozenberg},
 year         = {2013},
 title        = {Step semantics of boolean nets},
 journal      = {Acta Inf.},
 volume       = {50},
 number       = {1},
 pages        = {15--39},
 doi          = {10.1007/s00236-012-0170-2},
)
@article(DBLP:journals/acta/MontanariR95,
 author       = {Ugo Montanari and Francesca Rossi},
 year         = {1995},
 title        = {Contextual Nets},
 journal      = {Acta Inf.},
 volume       = {32},
 number       = {6},
 pages        = {545--596},
 doi          = {10.1007/BF01178907},
)
@article(DBLP:journals/dcg/MooreR01,
 author       = {Cristopher Moore and J. M. Robson},
 year         = {2001},
 title        = {Hard Tiling Problems with Simple Tiles},
 journal      = {Discrete {\&} Computational Geometry},
 volume       = {26},
 number       = {4},
 pages        = {573--590},
 doi          = {10.1007/s00454-001-0047-6},
)
@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},
)
@inproceedings(DBLP:conf/ac/RozenbergE96,
 author       = {Grzegorz Rozenberg and Joost Engelfriet},
 year         = {1996},
 title        = {Elementary Net Systems},
 booktitle    = {Petri Nets},
 series       = {Lecture Notes in Computer Science},
 volume       = {1491},
 publisher    = {Springer},
 pages        = {12--121},
 doi          = {10.1007/3-540-65306-6\_14},
)
@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},
)
@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},
)
@article(DBLP:journals/corr/abs-1806-03703,
 author       = {Ronny Tredup and Christian Rosenke},
 year         = {2018},
 title        = {Towards Completely Characterizing the Complexity of Boolean Nets Synthesis},
 journal      = {CoRR},
 volume       = {abs/1806.03703},
)
@inproceedings(DBLP:conf/tamc/TredupR19,
 author       = {Ronny Tredup and Christian Rosenke},
 year         = {2019},
 title        = {The Complexity of Synthesis for 43 Boolean Petri Net Types},
 booktitle    = {{TAMC}},
 series       = {Lecture Notes in Computer Science},
 volume       = {11436},
 publisher    = {Springer},
 pages        = {615--634},
 doi          = {10.1007/978-3-030-14812-6},
)
@inproceedings(DBLP:conf/apn/TredupR19,
 author       = {Ronny Tredup and Christian Rosenke},
 year         = {2019},
 title        = {On the Hardness of Synthesizing Boolean Nets},
 booktitle    = {ATAED@Petri Nets/ACSD},
 series       = {{CEUR} Workshop Proceedings},
 volume       = {2371},
 publisher    = {CEUR-WS.org},
 pages        = {71--86},
)
@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},
)