E. Badouel, L. Bernardinello, and P. Darondeau, Petri Net Synthesis, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01237142

K. Barylska, E. Best, E. Erofeev, L. Mikulski, and M. Piatkowski, On binary words being Petri net solvable, Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, pp.1-15, 2015.

K. Barylska, E. Best, E. Erofeev, L. Mikulski, and M. Piatkowski, Conditions for Petri net solvable binary words. T. Petri Nets and Other Models of Concurrency 11, pp.137-159, 2016.

E. Best and R. Devillers, Synthesis and reengineering of persistent systems, Acta Inf, vol.52, issue.1, pp.35-60, 2015.

E. Best and R. Devillers, Characterisation of the state spaces of marked graph Petri nets, Information and Computation, vol.253, issue.3, pp.399-410, 2017.

E. Best, R. Devillers, and U. Schlachter, Bounded choice-free Petri net synthesis: Algorithmic issues, Acta Informatica, 2017.

E. Best, R. Devillers, U. Schlachter, and H. Wimmel, Simultaneous petri net synthesis, Sci. Ann. Comp. Sci, vol.28, issue.2, pp.199-236, 2018.

E. Best, T. Hujsa, and H. Wimmel, Sufficient conditions for the marked graph realisability of labelled transition systems, Theoretical Computer Science, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02127711

F. Commoner, A. Holt, S. Even, and A. Pnueli, Marked directed graphs, J. Comput. Syst. Sci, vol.5, issue.5, pp.511-523, 1971.

S. Crespi-reghizzi and D. Mandrioli, A decidability theorem for a class of vector-addition systems, Inf. Process. Lett, vol.3, issue.3, pp.78-80, 1975.

,

J. M. Delosme, T. Hujsa, and A. Munier-kordon, Polynomial sufficient conditions of well-behavedness for weighted join-free and choice-free systems, 13th International Conference on Application of Concurrency to System Design, pp.90-99, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00863651

J. Desel and J. Esparza, Free Choice Petri Nets, Cambridge Tracts in Theoretical Computer Science, vol.40, 1995.

R. Devillers, Products of Transition Systems and Additions of Petri Nets, Proc. 16th International Conference on Application of Concurrency to System Design, pp.65-73, 2016.

R. Devillers, Factorisation of transition systems, Acta Informatica, 2017.

R. Devillers, E. Erofeev, and T. Hujsa, Synthesis of weighted marked graphs from constrained labelled transition systems, Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2018 Satellite event of the conferences: Petri Nets 2018 and ACSD, pp.75-90, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02127780

R. Devillers and T. Hujsa, Analysis and synthesis of weighted marked graph Petri nets, Application and Theory of Petri Nets and Concurrency: 39th International Conference, pp.1-21, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02127849

R. Devillers and T. Hujsa, Analysis and synthesis of weighted marked graph Petri nets: Exact and approximate methods, Fundamenta Informaticae, 2019.

E. Erofeev, K. Barylska, L. Mikulski, and M. Piatkowski, Generating all minimal Petri net unsolvable binary words, Proceedings of the Prague Stringology Conference 2016, pp.33-46, 2016.

E. Erofeev and H. Wimmel, Reachability graphs of two-transition Petri nets, Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, pp.39-54, 2017.

T. Hujsa, Contribution to the study of weighted Petri nets, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01127406

T. Hujsa, J. M. Delosme, and A. Munier-kordon, On the reversibility of well-behaved weighted choice-free systems, pp.334-353, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01017044

T. Hujsa, J. M. Delosme, and A. Munier-kordon, Polynomial sufficient conditions of well-behavedness and home markings in subclasses of weighted Petri nets, ACM Trans. Embed. Comput. Syst, vol.13, issue.4s, pp.1-141, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01053867

T. Hujsa and R. Devillers, On liveness and deadlockability in subclasses of weighted Petri nets, Application and Theory of Petri Nets and Concurrency: 38th International Conference, PETRI NETS 2017, pp.267-287, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02127837

N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, vol.4, issue.4, pp.373-395, 1984.

T. Murata, Petri nets: properties, analysis and applications, Proceedings of the IEEE, vol.77, pp.541-580, 1989.

E. Teruel, P. Chrzastowski-wachtel, J. M. Colom, and M. Silva, On weighted Tsystems, 13th International Conference on Application and Theory of Petri Nets and Concurrency (ICATPN), vol.616, pp.348-367, 1992.

E. Teruel, J. M. Colom, and M. Silva, Choice-Free Petri Nets: a Model for Deterministic Concurrent Systems with Bulk Services and Arrivals, IEEE Transactions on Systems, Man, and Cybernetics, Part A, vol.27, issue.1, pp.73-83, 1997.

,

E. Teruel and M. Silva, Structure theory of Equal Conflict systems, Theoretical Computer Science, vol.153, issue.1&2, pp.271-300, 1996.