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.
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.
Eric Badouel & Philippe Darondeau (1995):
Trace Nets and Process Automata.
Acta Inf. 32(7),
pp. 647–679,
doi:10.1007/BF01186645.
Jordi Cortadella (2017):
Private Correspondance.
Jetty Kleijn, Maciej Koutny, Marta Pietkiewicz-Koutny & Grzegorz Rozenberg (2013):
Step semantics of boolean nets.
Acta Inf. 50(1),
pp. 15–39,
doi:10.1007/s00236-012-0170-2.
Cristopher Moore & J. M. Robson (2001):
Hard Tiling Problems with Simple Tiles.
Discrete & Computational Geometry 26(4),
pp. 573–590,
doi:10.1007/s00454-001-0047-6.
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.
Grzegorz Rozenberg & Joost Engelfriet (1996):
Elementary Net Systems.
In: Petri Nets,
Lecture Notes in Computer Science 1491.
Springer,
pp. 12–121,
doi:10.1007/3-540-65306-6_14.
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.
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.
Ronny Tredup & Christian Rosenke (2018):
Towards Completely Characterizing the Complexity of Boolean Nets Synthesis.
CoRR abs/1806.03703.
Ronny Tredup & Christian Rosenke (2019):
The Complexity of Synthesis for 43 Boolean Petri Net Types.
In: TAMC,
Lecture Notes in Computer Science 11436.
Springer,
pp. 615–634,
doi:10.1007/978-3-030-14812-6.
Ronny Tredup & Christian Rosenke (2019):
On the Hardness of Synthesizing Boolean Nets.
In: ATAED@Petri Nets/ACSD,
CEUR Workshop Proceedings 2371.
CEUR-WS.org,
pp. 71–86.
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.
eptcs@eptcs.org