G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, A symbolic reachability graph for coloured petri nets, Theoretical Computer Science, vol.176, issue.1-2, pp.39-65, 1997.
DOI : 10.1016/S0304-3975(96)00010-2

A. Donaldson and A. Miller, Exact and Approximate Strategies for Symmetry Reduction in Model Checking, Fm 2006: Formal methods, pp.541-55611813040, 1007.
DOI : 10.1007/11813040_36

E. A. Emerson and A. P. Sistla, Symmetry and model checking, Formal Methods in System Design, pp.105-131, 1996.

M. Hendriks, G. Behrmann, K. G. Larsen, P. Niebert, and F. W. Vaandrager, Adding Symmetry Reduction to Uppaal, Formal modeling and analysis of timed systems (FORMATS'03), pp.46-59, 2004.
DOI : 10.1007/978-3-540-40903-8_5

T. Junttila, On the symmetry reduction method for Petri nets and similar formalisms, 2003.

I. C. Norris and D. L. Dill, Better verification through symmetry, Formal Methods in System Design, pp.41-75, 1996.
DOI : 10.1007/BF00625968

K. Schmidt, How to calculate symmetries of Petri nets, Acta Informatica, vol.36, issue.7, pp.545-590, 2000.
DOI : 10.1007/s002360050002

C. C. Sims, Computational methods in the study of permutation groups, Computational problems in abstract algebra, pp.169-183, 1970.

P. H. Starke, Reachability analysis of Petri nets using symmetries, Systems Analysis Modelling Simulation, vol.8, pp.4-5, 1991.

Y. Thierry-mieg, B. Bérard, F. Kordon, D. Lime, and O. H. Roux, (s. d.) Compositional analysis of discrete time Petri nets, 1st workshop on Petri nets compositions, pp.17-31, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00807360