R. Bouroulet, R. Devillers, H. Klaudel, E. Pelz, and F. Pommereau, Modeling and analysis of security protocols using role based specifications and Petri nets, ICATPN'08, vol.5062, pp.72-91, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00340476

C. Bui-thanh, H. Klaudel, and F. Pommereau, Box calculus with coloured buffers, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00114687

C. Bui-thanh, H. Klaudel, and F. Pommereau, Petri nets with causal time for system verification, MTCS'02, vol.68, pp.1-16, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00114682

C. Bui-thanh, H. Klaudel, and F. Pommereau, Box calculus with high-level buffers, DADS'04, pp.1-6, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00114672

C. Chaouiya, H. Klaudel, and F. Pommereau, A Petri net based framework for a qualitative modelling of regulatory networks encompassing inter-cellular signalling, JB'09, pp.1-5, 2009.

C. Chaouiya, H. Klaudel, and F. Pommereau, Qualitative modelling of regulatory networks using Petri nets: application to developmental processes, chapter in preparation

R. Devillers, H. Klaudel, M. Koutny, E. Pelz, and F. Pommereau, Operational semantics for PBC with asynchronous communication, HPC'02, pp.1-6, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00114684

R. Devillers, H. Klaudel, M. Koutny, and F. Pommereau, An algebra of non-safe Petri boxes, AMAST'02, vol.2422, pp.185-214, 2002.

R. Devillers, H. Klaudel, M. Koutny, and F. Pommereau, Asynchonous box calculus. Fundamenta Informaticae, vol.54, issue.1, pp.1-50, 2003.

H. Klaudel, M. Koutny, E. Pelz, and F. Pommereau, Towards efficient verification of systems with dynamic process creation, ICTAC'08, vol.5160, pp.186-200, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00666665

H. Klaudel, M. Koutny, E. Pelz, and F. Pommereau, Towards efficient verification of systems with dynamic process creation, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00666665

H. Klaudel, M. Koutny, E. Pelz, and F. Pommereau, An approach to state space reduction for systems with dynamic process creation, ISCIS'09, pp.1-6
URL : https://hal.archives-ouvertes.fr/hal-00666664

H. Klaudel and F. Pommereau, Asynchronous links in the PBC and M-nets, ASIAN'99, vol.1742, pp.190-200, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00114697

H. Klaudel and F. Pommereau, A concurrent and compositional Petri net semantics of preemption, IFM'00, vol.1945, pp.318-337, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00114693

H. Klaudel and F. Pommereau, A concurrent semantics of static exceptions in a parallel programming language, ICATPN'01, vol.2075, pp.204-223, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00114689

H. Klaudel and F. Pommereau, A class of composable and preemptible high-level Petri nets with an application to multi-tasking systems, Fundamenta Informaticae, vol.50, issue.1, pp.33-55, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00114685

H. Klaudel and F. Pommereau, M-nets: a survey, Acta Informatica, vol.45, issue.7-8, pp.537-564, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00870484

F. Pommereau, SNAKES is the net algebra

F. Pommereau, FIFO buffers in tie sauce, DAPSYS'00, pp.95-104, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00114694

F. Pommereau, Modèles composables et concurrents pour le temps-réel, 2002.

F. Pommereau, Causal time calculus, FORMATS'03, vol.2791, pp.1-12, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00114673

F. Pommereau, Petri nets as executable specifications of high-level timed parallel systems, PAPP/ICCS'04, vol.3038, pp.331-338, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00114670

F. Pommereau, Versatile boxes: a multi-purpose algebra of high-level Petri nets, DADS'07, pp.665-672, 2004.

F. Pommereau, Petri nets as executable specifications of high-level timed parallel systems, Scalable Computing: Practice and Experience, vol.6, issue.6, pp.71-82, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00114670

F. Pommereau, Quickly prototyping Petri nets tools with SNAKES. Petri net newsletter, pp.1-18, 2008.

F. Pommereau, Quickly prototyping Petri nets tools with SNAKES, PNTAP'08, pp.1-10, 2008.

F. Pommereau, Nets-in-nets with SNAKES, MOCA'09, pp.107-126, 2009.

F. Pommereau, R. Devillers, and H. Klaudel, Efficient reachability graph representation of Petri nets with unbounded counters, INFINITY'07, vol.239, pp.1-10, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00340494

F. Pommereau and C. Stehno, FIFO buffers is hot tie sauce, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00114692

. Anr and . Spreads, , 2007.

M. Abadi and A. D. Gordon, A calculus for cryptographic protocols: the spi calculus, CCS'97, 1997.

A. Olga-marroquín, D. De, and F. Escrig, Extending the Petri box calculus with time, ICATPN'01, vol.2075, 2001.

, AlPiNA: an algebraic Petri net analyzer

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, 1994.

, AVISPA: Automated validation of Internet security protocols and applications

S. Bardin, A. Finkel, J. Leroux, and L. Petrucci, FAST: Fast acceleration of symbolic transition systems, CAV'03, vol.2725, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00084185

S. Bardin and L. Petrucci, Workshop on Definition, Implementation and Application of a Standard Interchange Format for Petri Nets, 2004.

, Handbook of Process Algebra, 2001.

E. Best and R. Devillers, Sequential and concurrent behaviour in Petri net theory, Theoretical Computer Science, vol.55, issue.1, 1987.

E. Best, R. Devillers, and J. G. Hall, The box calculus: a new causal algebra with multilabel communication, Advances in Petri Nets, 1992.

E. Best, R. Devillers, and M. Koutny, Petri net algebra, 2001.

E. Best, W. Fraczak, R. P. Hopkins, H. Klaudel, and E. Pelz, M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages, Acta Informatica, vol.35, issue.10, 1998.

E. Best and R. P. Hopkins, B(PN) 2 -a basic Petri net programming notation, PARLE'93

. Springer, , 1993.

B. Blanchet, An efficient cryptographic protocol verifier based on Prolog rules, IEEE CSFW'01, 2001.

Y. Boichut, P. Héam, and O. Kouchnarenko, Handling algebraic properties in automatic analysis of security protocols, ICTAC'06, vol.4281, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00070169

B. Boigelot, The Liège automata-based symbolic handler

D. Bosnacki, D. Dams, and L. Holenderski, Symmetric Spin, International Journal Software Tools for Technology Transfer, vol.4, issue.1, 2002.

C. Boukala and L. Petrucci, Towards distributed verification of Petri nets properties, VECOS'07, eWiC, 2007.

R. Bouroulet, H. Klaudel, and E. Pelz, A semantics of security protocol language (SPL) using a class of composable high-level Petri nets, ACSD'04, 2004.

R. Bouroulet, H. Klaudel, and E. Pelz, Modelling and verification of authentication using enhanced net semantics of SPL (security protocol language), ACSD'06, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00340477

D. Buchs and S. Hostettler, Managing complexity in model checking with decision diagrams for algebraic petri net, Pre-proceedings of PNSE'09, 2009.

C. Bui and T. , Generating coloured Petri nets of concurrent object-oriented programs, ESMc'04. EUROSIS, 2004.

B. Bérard and M. Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, and Philippe Schnoebelen. Systems and software verification: model-checking techniques and tools, 2001.

C. Chaouiya, É. Remy, P. Ruet, and D. Thieffry, Qualitative modelling of genetic networks: From logical regulatory graphs to standard Petri nets, ICATPN'04, vol.3099, 2004.

C. Chaouiya, É. Remy, and D. Thieffry, Qualitative Petri net modelling of genetic networks, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00310988

G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, On well-formed coloured nets and their symbolic reachability graph, High-Level Petri Nets -Theory and Application, 1991.

S. Christensen, L. Michael-kristensen, and T. Mailund, A sweep-line method for state space exploration, TACAS'01, vol.2031, 2001.

S. Christensen and L. Petrucci, Modular analysis of Petri nets, The Computer Journal, vol.43, issue.3, 2000.

E. M. Clarke, E. A. Emerson, S. Jha, and A. P. Sistla, Symmetry reductions in model checking, CAV'98, vol.1427, 1998.

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, issue.10, 2004.

J. Couvreur, A BDD-like implementation of an automata package, CIAA'04, vol.3317, 2004.

J. Couvreur, E. Encrenaz, E. Paviot-adet, D. Poitrenaud, and P. Wacrenier, Data decision diagrams for Petri net analysis, ICATPN'02, vol.34, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01544997

F. Crazzolara and G. Winskel, Events in security protocols, CCS'01, 2001.

J. Hidde-de, Modeling and simulation of genetic regulatory systems: a literature review, Journal of Computational Biology, vol.1, issue.9, 2002.

R. R. Devillers, H. Klaudel, and R. Riemann, General parameterised refinement and recursion for the M-net calculus, Theoretical Compututer Science, vol.300, issue.1-3, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00005602

W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, 1976.

D. Dolev and A. Yao, On the security of public key protocols, IEEE Transactions on Information Theory, vol.29, issue.2, 1983.

H. Ehrig and B. Mahr, Fundamentals of Algebraic Specification I, 1985.

J. Elgaard, N. Klarlund, and A. Møller, MONA 1.x: new techniques for WS1S and WS2S, CAV'98, vol.1427, 1998.

J. Ellson, R. Emden, E. Gansner, S. C. Koutsofios, G. North et al., Graphviz -open source graph drawing tools, Graph Drawing'01, vol.2265, 2001.

J. Esparza and M. Nielsen, Decidability issues for Petri nets-A survey, Bulletin of the European Association for Theoretical Computer Science, vol.52, 1994.

J. Esparza, S. Römer, and W. Vogler, An improvement of McMillan's unfolding algorithm, FMSD'96, 1996.

S. Evangelista, S. Haddad, and J. Pradat-peyre, New coloured reductions for software validation, WODES'04, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01124921

S. Evangelista, S. Haddad, and J. Pradat-peyre, Syntactical colored Petri nets reductions, ATVA'05, vol.3707, 2005.

S. Evangelista and J. Pradat-peyre, An efficient algorithm for the enabling test of colored Petri nets, CPN'04, number 570 in DAIMI report PB. University ofÅrhus, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01124934

S. Evangelista and J. Pradat-peyre, Memory efficient state space storage in explicit software model checking, SPIN'05, vol.3639, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01125050

S. Evangelista and J. Pradat-peyre, On the computation of stubborn sets of colored Petri nets, ICATPN'06, vol.4024, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00145906

A. Fauré, A. Naldi, C. Chaouiya, and D. Thieffry, Dynamical analysis of a generic Boolean model for the control of the mammalian cell cycle, Bioinformatics, vol.22, issue.14, 2006.

A. Aric, D. A. Hagberg, P. J. Schult, and . Swart, Exploring network structure, dynamics, and function using NetworkX, SciPy'08, 2008.

A. Hamez, Y. Thierry-mieg, and F. Kordon, Hierarchical set decision diagrams and automatic saturation, ICATPN'08, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01303835

K. Heljanko, V. Khomenko, and M. Koutny, Parallelisation of the Petri net unfolding algorithm, TACAS'02, vol.2280, 2002.

M. Hendriks, G. Behrmann, K. G. Larsen, P. Niebert, and F. W. Vaandrager, Adding symmetry reduction to Uppaal, FORMATS'03, vol.2791, 2003.

G. J. Holzmann, An analysis of bitstate hashing, Formal Methods in System Design, vol.13, issue.3, 1998.

J. Gerard, . Holzmann, and . Spin,

C. , N. Ip, and D. L. Dill, Better verification through symmetry, Formal Methods in System Design, vol.9, issue.1-2, 1996.

K. Jensen and L. M. Kristensen, Coloured Petri Nets: Modelling and Validation of Concurrent Systems, 2009.

T. Junttila, On the Symmetry Reduction Method for Petri Nets and Similar Formalisms, 2003.

J. B. Jørgensen and L. M. Kristensen, Verification of coloured Petri nets using state spaces with equivalence classes, LINCOM Studies in Computer Science, vol.1, 2003.

V. Khomenko, Punf: Petri net unfolder

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

K. Klai, L. Petrucci, and M. Reniers, An incremental and modular technique for checking LTL\X properties of Petri nets, FORTE'07, 2007.

H. Klaudel, Parameterized M-expression semantics of parallel procedures, DAPSYS'00, 2000.

M. Koutny, A compositional model of time Petri nets, ICATPN'00, vol.1825, 2000.

L. Michael-kristensen and T. Mailund, A generalised sweep-line method for safety properties, FME/FM'02, vol.2391, 2002.

F. Lerda and R. Sisto, Distributed-memory model checking with Spin, SPIN'99, 1999.

G. Lewis and C. Lakos, Incremental state space construction for coloured Petri nets, ICATPN'01, 2001.

K. L. Macmillan, Symbolic Model Checking, 1993.

M. Mäkelä and . Maria, Modular reachability analyser for algebraic system nets, ICATPN'02, vol.2360, 2002.

L. Mendoza, A network model for the control of the differentiation process in Th cells, Biosystems, vol.84, issue.2, 2006.

M. Philip, D. J. Merlin, and . Farber, Recoverability of communication protocols: Implications of a theoretical study, IEEE Transaction on Communications, vol.24, issue.9, 1976.

O. Michel, There is plenty of room for unconventional programming languages or declaratives simulations of dynamicals systems (with a dynamical structure), 2007.

O. Michel, J. Giavitto, J. Cohen, A. Spicher, and . Mgs,

A. Miller, A. Donaldson, and M. Calder, Symmetry in temporal logic model checking, ACM Computing Surveys (CSUR), vol.38, issue.3, 2006.

R. Milner, Communicating and Mobile Systems: the Pi-Calculus, 1999.

M. Mäkelä and . Maria, The modular reachability analyzer

M. Mäkelä, Applying compiler techniques to reachability analysis of high-level models, CS&P'00, number 140 in Informatik-Bericht, 2000.

M. Mäkelä, Condensed storage of multi-set sequences, CPN'00, number 547 in DAIMI report PB. University ofÅrhus, 2000.

M. Mäkelä, Optimising enabling tests and unfoldings of algebraic system nets, ICATPN'01, vol.2075, 2001.

M. Mäkelä, A reachability analyser for algebraic system nets, 2001.

M. Roger, M. D. Needham, and . Schroeder, Using encryption for authentication in large networks of computers, Communication of the ACM, vol.21, issue.12, 1978.

C. Pajault, S. Evangelista, and . Helena,

C. Pajault and J. Pradat-peyre, Distributed colored Petri net model-checking with Cyclades, FMICS/PDMC'06, vol.4346, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01125215

, The PEP tool

E. Pelz and D. Tutsch, Formal models for multicast traffic in network on chip architectures with compositional high-level Petri nets, ICATPN'07, vol.4546, 2007.

J. L. Peterson, Petri nets, ACM Computing Surveys, vol.9, issue.3, 1977.

J. Lyle-peterson, Petri Net Theory and the Modeling of Systems, vol.89, 1981.

W. Pugh, The Omega test: a fast and practical integer programming algorithm for dependence analysis, ACM/IEEE SC'91, 1991.

, Python Software Foundation

M. O. Rabbin, Decidability of second-order theories and automata on infinite trees, Transactions of the AMS, vol.141, 1969.

C. Ramchandani, Analysis of Asynchronous Concurrent Systems by Timed Petri Nets, 1974.

K. Reinhardt, Reachability in Petri nets with inhibitor arcs, ENTCS, vol.223, 2008.

C. Reinke, Haskell-coloured Petri nets, IFL'99, 2000.

, The Petri net kernel

J. Saez-rodriguez, L. Simeoni, J. A. Lindquist, R. Hemenway, U. Bommhardt et al., A logical model provides insights into T cell receptor signaling, PLoS Computational Biology, vol.3, 2007.

L. Sánchez, C. Chaouiya, and D. Thieffry, Segmenting the fly embryo: a logical analysis of the segment polarity cross-regulatory module, The International Journal of Developmental Biology, vol.52, issue.8, 2008.

L. Sánchez and D. Thieffry, A logical analysis of the drosophila gap-gene system, Journal of Theoretical Biology, vol.211, issue.2, 2001.

L. Sánchez and D. Thieffry, Segmenting the fly embryo: a logical analysis of the pair-rule cross-regulatory module, Journal of Theoretical Biology, vol.224, issue.4, 2003.

T. Schlitt and A. Brazma, Current approaches to gene regulatory network modelling, BMC Bioinformatics, vol.8, issue.6, 2007.

D. B. Skillicorn, J. M. Hill, and W. F. Mccoll, Questions and answers about, BSP. Scientific Programming, vol.6, issue.3, 1997.

L. , J. Steggles, R. Banks, O. Shaw, and A. Wipat, Qualitatively modelling and analysing genetic regulatory networks: a Petri net approach, Bioinformatics, vol.23, issue.3, 2007.

R. Thomas, Boolean formalisation of genetic control circuits, Journal of Theoretical Biology, vol.42, 1973.

R. Thomas, D. Thieffry, and M. Kaufman, Dynamical behaviour of biological regulatory networks-I. Biological role of feedback loops and practical use of the concept of the loop-characteristic state, Bulletin of mathematical Biology, vol.57, issue.57, 1995.

R. Valk, Object Petri nets: Using the nets-within-nets paradigm, Advanced course on Petri nets, vol.3098, pp.819-848, 2003.