T. Murata, Petri nets : Properties, analysis and applications, Proc. IEEE, vol.77, pp.541-580, 1989.

J. L. Peterson, Petri nets, ACM Computer Surveys, vol.9, issue.3, pp.223-252, 1977.

N. D. Jones, L. H. Landweber, and Y. E. Lien, Complexity of some problems in Petri nets, Theoretical Computer Science, vol.4, issue.3, pp.277-299, 1977.

E. A. Lee and D. G. Messerschmitt, Synchronous data flow, vol.75, 1987.

M. Engels, G. Bilsen, R. Lauwereins, and J. Peperstraete, Cycle-static dataflow: model and implementation, Signals, Systems and Computers. Record of the 20th Asilomar Conference, vol.1, pp.503-507, 1994.

M. Wiggers, M. Bekooij, P. Jansen, and G. Smit, Efficient computation of buffer capacities for cyclo-static real-time systems with back-pressure, 13th IEEE RTAS '07, pp.281-292

E. Teruel, P. Chrzastowski-wachtel, J. M. Colom, and M. Silva, On weighted T-systems," in Application and Theory of Petri Nets, 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

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

L. Recalde, E. Teruel, and M. Silva, On well-formedness analysis: The case of deterministic systems of sequential processes, STRICT, pp.279-293, 1995.

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

E. Teruel, J. M. Colom, and M. Silva, Choice-Free Petri nets: a model for deterministic concurrent systems with bulk services and arrivals, IEEE Trans. on Syst., Man, and Cyber., Part A, vol.27, issue.1, pp.73-83, 1997.

C. Amer-yahia and N. Zerhouni, Structure theory of ChoiceFree Petri nets based on eigenvalues, Journal of the Franklin Institute, vol.336, issue.5, pp.833-849, 1999.

K. Barkaoui and M. Minoux, A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets, ATPN '92, ser, vol.616, pp.62-75
URL : https://hal.archives-ouvertes.fr/hal-01125465

D. Y. Chao and J. A. Nicdao, Liveness for Synchronized Choice Petri nets, The Computer Journal, vol.44, issue.2, pp.124-136, 2001.
DOI : 10.1093/comjnl/44.2.124

P. Alimonti, E. Feuerstein, L. Laura, and U. Nanni, Linear time analysis of properties of Conflict-Free and general Petri nets, Theor. Comp. Sci, vol.412, issue.4-5, pp.320-358, 2011.

K. Barkaoui and J. Pradat-peyre, On liveness and controlled siphons in Petri nets, vol.1091, pp.57-72, 1996.
URL : https://hal.archives-ouvertes.fr/hal-01124759

Q. Zhen and W. Lu, On liveness and safeness for weighted Extended Free Choice nets, JoS, vol.11, issue.3, pp.300-307, 2000.

L. Jiao, T. Cheung, and W. Lu, On liveness and boundedness of Asymmetric Choice nets, Theoretical Computer Science, vol.311, issue.1-3, pp.165-197, 2004.

C. Amer-yahia, N. Zerhouni, A. E. Moudni, and M. Ferney, Some subclasses of Petri nets and the analysis of their structural properties: a new approach, IEEE Trans. Syst.M.C., Part A, vol.29, issue.2, pp.164-172, 1999.

A. Frommer and D. Szyld, On asynchronous iterations, Journal of Computational and Applied Mathematics, vol.123, pp.201-216, 2000.
DOI : 10.1016/s0377-0427(00)00409-x
URL : https://doi.org/10.1016/s0377-0427(00)00409-x

R. Mayr, Information and Computation, vol.156, pp.264-286, 2000.

A. Bouajjani and T. Touili, On computing reachability sets of Process Rewrite Systems, RTA, pp.484-499, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00161108

J. Esparza, Petri nets, commutative context-free grammars, and basic parallel processes, Fundamenta Informaticae, vol.31, pp.13-26, 1997.
DOI : 10.1007/3-540-60249-6_54

N. Megiddo, On the complexity of linear programming, ser, Advances in economic theory: Fifth world congress, T. Bewley, 1987.