T. Ball, S. Chaki, and S. K. Rajamani, Parameterized Verification of Multithreaded Software Libraries. Proc. TACAS'01, vol.2031, pp.158-173, 2001.

E. Best, M-Nets: An Algebra of High-Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages, Acta Informatica, vol.35, pp.813-857, 1998.

D. Bosnacki, D. Dams, and L. Holenderski, Symmetric Spin, International Journal on Software Tools for Technology Transfer, vol.4, pp.92-106, 2002.

G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, A Symbolic Reachability Graph for Coloured Petri Nets, Theoretical Computer Science, vol.176, pp.39-65, 1997.

E. Clarke, O. Grumberg, and D. , Peled: Model Checking, 2000.

J. C. Corbett, Bandera: Extracting Finite-state Models from Java Source Code. Proc. ICSE'00, pp.439-448, 2000.

L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, pp.1367-1372, 2004.

P. Cousot and R. Cousot, Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints, Proc. POPL'77, pp.238-252, 1977.

G. Delzanno, Constraint-based Automatic Verification of Abstract Models of Multithreaded Programs, Journal of Theory and Practice of Logic Programming, vol.7, 2007.

S. Evangelista, High Level Petri Nets Analysis with Helena, Proc. ICATPN'05, vol.3536, pp.455-464, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00149528

C. Flanagan, S. N. Freund, S. Qadeer, and S. A. Seshia, Modular Verification of Multithreaded Programs, Theoretical Computer Science, vol.338, pp.153-183, 2005.

A. Hagberg, D. Schult, and P. Swart, NetworkX, High Productivity Software for Complex Networks

M. Hendriks, Adding Symmetry Reduction to Uppaal, Proc. FORMATS'03, vol.2791, pp.46-59, 2003.

V. Khomenko, Model Checking Based on Prefixes of Petri Net Unfoldings, 2003.

Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems Specification, 1991.

K. Mcmillan, Symbolic Model Checking. Kluwer Academic, 1993.

A. Miller, A. Donaldson, and M. Calder, Symmetry in Temporal Logic Model Checking, vol.38, 2006.

F. Pommereau, Versatile Boxes, a Multi-Purpose Algebra of High-Level Petri Nets, Proc. DADS/SCSC'07, 2007.

F. Pommereau, Quickly Prototyping Petri Net Tools with Snakes. Proc. PNTAP'08, 2008.

M. O. Rabin, Decidability of Second-order Theories and Automata on Infinite Trees, Transactions of the American Mathematical Society, vol.141, 1969.

F. Rosa-velardo and D. De, Frutos-Escrig: Name Creation vs. Replication in Petri Net Systems, Proc. ICATPN'07, vol.4546, pp.402-422, 2007.

R. F. Stärk, Formal Specification and Verification of the C# Thread Model, Theoretical Computer Science, vol.343, pp.482-508, 2005.

S. D. , Stoller: Model-Checking Multi-threaded Distributed Java Programs, Proc. SPIN'00, vol.1885, pp.224-244, 2000.

Y. Thierry-mieg, C. Dutheillet, and I. Mounier, Automatic Symmetry Detection in Well-Formed Nets, Proc. ICATPN'03, vol.2679, pp.82-101, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01531070

, Moreover, all pids (present as vertexes of the third layer) are related through h, which is also the identity on D in tokens in control-flow and data places. So, the marking equivalence follows

, ? By definition 8, h-equivalent markings M i generate graph representations R i which only differ by the identity of some vertexes (their number, arcs and labelling being identical). By definition 7, h is the identity on D in tokens in data and control-flow places, and relates pids between M 1 and M 2 . So h relates in the same way the identities of vertexes in V 1 and V 2

, comp, p.0

, comp (pid:1.1.1) 7: 2, vol.2, p.0

, comp, p.1

, comp (pid:1.1.1) 27: 2, vol.2, p.1

, comp