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

T. Hujsa, J. M. Delosme, and A. Munier-kordon, On Liveness and Reversibility of Equal-Conflict Petri Nets. Fundamenta Informaticae, vol.146, pp.83-119, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01716969

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, pp.267-287, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02127837

M. Silva, E. Teruel, and J. M. Colom, Linear algebraic and linear programming techniques for the analysis of place/transition net systems, Lectures on Petri Nets I: Basic Models, vol.1491, pp.309-373, 1998.

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

E. A. Lee and D. G. Messerschmitt, Synchronous Data Flow, Proceedings of the IEEE, vol.75, pp.1235-1245, 1987.

E. Lee and D. Messerschmidt, Static scheduling of synchronous data flow programs for digital signal processing, IEEE Transaction on Computers, C, vol.36, issue.1, pp.24-35, 1987.

J. L. Pino, S. S. Bhattacharyya, and E. A. Lee, A hierarchical multiprocessor scheduling framework for synchronous dataflow graphs, 1995.

S. Sriram and S. S. Bhattacharyya, Embedded multiprocessors: scheduling and synchronization. Signal Processing and Communications, 2009.

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

O. Marchetti and A. Munier-kordon, A sufficient condition for the liveness of Weighted Event Graphs, European Journal of Operational Research, vol.197, issue.2, pp.532-540, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01197183

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

T. Hujsa, J. Delosme, and A. M. Kordon, On the Reversibility of Well-Behaved Weighted Choice-Free Systems, Application and Theory of Petri Nets and Concurrency -35th International Conference, PETRI NETS 2014, pp.334-353, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01017044

E. Best and R. Devillers, Synthesis of Bounded Choice-Free Petri Nets, 26th International Conference on Concurrency Theory, pp.128-141, 2015.

E. Best, R. Devillers, and U. Schlachter, Bounded Choice-Free Petri Net Synthesis: Algorithmic Issues, Acta Informaticae, vol.55, issue.7, pp.575-611, 2018.

R. Devillers, E. Erofeev, and T. Hujsa, Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems. International Workshop on Algorithms & Theories for the Analysis of Event Data, pp.75-90, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02127780

U. Schlachter, Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets, LATA 2018, vol.10792, pp.296-307, 2018.

U. Schlachter, Petri Net Synthesis and Modal Specifications, 2018.

E. Best and R. Devillers, Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets, 8th International Conference on Language and Automata Theory and Applications, pp.161-172, 2014.

E. Best and R. Devillers, State space axioms for T-systems, Acta Informaticae, vol.52, issue.2-3, pp.133-152, 2015.

E. Best and R. Devillers, Characterisation of the State Spaces of Marked Graph Petri Nets. Information and Computation, vol.253, pp.399-410, 2017.

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, PETRI, pp.19-39, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02127849

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, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01053867

J. 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

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.

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. Best and R. Devillers, Synthesis and reengineering of persistent systems, Acta Informaticae, vol.52, issue.1, pp.35-60, 2015.

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

R. M. Keller, A Fundamental Theorem of Asynchronous Parallel Computation, Sagamore Computer Conference 1974, vol.24, pp.102-112, 1975.

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

E. Best and R. Devillers, Synthesis of Persistent Systems. Application and Theory of Petri Nets and Concurrency -35th International Conference, PETRI NETS, Proceedings, pp.111-129, 2014.

E. Best and R. Devillers, Synthesis of live and bounded persistent systems. Fundamenta Informaticae, vol.140, pp.39-59, 2015.

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 Informaticae, vol.55, issue.4, pp.339-362, 2018.

R. Devillers and U. Schlachter, Factorisation of Petri Net Solvable Transition Systems, Application and Theory of Petri Nets and Concurrency -39th International Conference, pp.82-98, 2018.

A. Ehrenfeucht and G. Rozenberg, Partial (Set) 2-Structures. Part I: Basic Notions and the Representation Problem, Acta Informaticae, vol.27, issue.4, pp.315-342, 1990.

A. Ehrenfeucht and G. Rozenberg, A Characterization of Set Representable Labeled Partial 2-Structures Through Decompositions, Acta Informaticae, vol.28, issue.1, pp.83-94, 1990.

P. Darondeau, Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets, Inf. Process. Lett, vol.94, issue.6, pp.241-245, 2005.

E. Best and P. Darondeau, A decomposition theorem for finite persistent transition systems, Acta Inf, vol.46, issue.3, pp.237-254, 2009.