, Parameterized Verification of Multithreaded Software Libraries. Proc. TACAS'01, vol.2031, pp.158-173, 2001.
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. ,
Symmetric Spin, International Journal on Software Tools for Technology Transfer, vol.4, pp.92-106, 2002. ,
A Symbolic Reachability Graph for Coloured Petri Nets, Theoretical Computer Science, vol.176, pp.39-65, 1997. ,
Peled: Model Checking, 2000. ,
, Bandera: Extracting Finite-state Models from Java Source Code. Proc. ICSE'00, pp.439-448, 2000.
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, pp.1367-1372, 2004. ,
Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints, Proc. POPL'77, pp.238-252, 1977. ,
Constraint-based Automatic Verification of Abstract Models of Multithreaded Programs, Journal of Theory and Practice of Logic Programming, vol.7, 2007. ,
High Level Petri Nets Analysis with Helena, Proc. ICATPN'05, vol.3536, pp.455-464, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00149528
Modular Verification of Multithreaded Programs, Theoretical Computer Science, vol.338, pp.153-183, 2005. ,
, NetworkX, High Productivity Software for Complex Networks
Adding Symmetry Reduction to Uppaal, Proc. FORMATS'03, vol.2791, pp.46-59, 2003. ,
Model Checking Based on Prefixes of Petri Net Unfoldings, 2003. ,
The Temporal Logic of Reactive and Concurrent Systems Specification, 1991. ,
, Symbolic Model Checking. Kluwer Academic, 1993.
, Symmetry in Temporal Logic Model Checking, vol.38, 2006.
Versatile Boxes, a Multi-Purpose Algebra of High-Level Petri Nets, Proc. DADS/SCSC'07, 2007. ,
, Quickly Prototyping Petri Net Tools with Snakes. Proc. PNTAP'08, 2008.
Decidability of Second-order Theories and Automata on Infinite Trees, Transactions of the American Mathematical Society, vol.141, 1969. ,
Frutos-Escrig: Name Creation vs. Replication in Petri Net Systems, Proc. ICATPN'07, vol.4546, pp.402-422, 2007. ,
Formal Specification and Verification of the C# Thread Model, Theoretical Computer Science, vol.343, pp.482-508, 2005. ,
Stoller: Model-Checking Multi-threaded Distributed Java Programs, Proc. SPIN'00, vol.1885, pp.224-244, 2000. ,
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