F. B. Bowen-alpern and . Schneider, Recognizing safety and liveness, Distributed computing, pp.117-126, 1987.

R. Alur, C. Courcoubetis, and D. Dill, Model-checking for real-time systems, LICS'90, Proceedings ., Fifth Annual IEEE Symposium on e, pp.414-425, 1990.

R. Alur, L. David, and . Dill, A theory of timed automata. Theoretical computer science, pp.183-235, 1994.

H. Andersen, Partial model checking, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, pp.398-407, 1995.
DOI : 10.1109/LICS.1995.523274

H. Reif-andersen and J. Lind-nielsen, Partial model checking of modal equations: A survey, International Journal on Software Tools for Technology Transfer, vol.2, issue.3, pp.242-259, 1999.
DOI : 10.1007/s100090050032

N. Ayewah, D. Hovemeyer, J. David-morgenthaler, W. Penix, and . Pugh, Using static analysis to find bugs. Software, IEEE, vol.25, issue.5, pp.22-29, 2008.
DOI : 10.1109/ms.2008.130
URL : http://www.cs.umd.edu/%7Eayewah/web/pubs/UsingFindBugs08.pdf

R. Barbuti, A. Nicoletta-de-francesco, G. Santone, and . Vaglini, Selective Mu-Calculus and Formula-Based Equivalence of Transition Systems, Journal of Computer and System Sciences, vol.59, issue.3, pp.537-556, 1999.
DOI : 10.1006/jcss.1999.1660

S. Basu and C. Ramakrishnan, Compositional analysis for verification of parameterized systems, Theoretical Computer Science, vol.354, issue.2, pp.211-229, 2006.
DOI : 10.1016/j.tcs.2005.11.016

B. Bérard, M. Bidoit, A. Finkel, F. Laroussinie, A. Petit et al., Systems and software verification : model-checking techniques and tools, 2013.
DOI : 10.1007/978-3-662-04558-9

A. Jan, A. Bergstra, . Ponse, A. Scott, and . Smolka, Handbook of process algebra, 2001.

E. Best, R. Devillers, and J. G. Hall, The box calculus: A new causal algebra with multi-label communication, 1992.
DOI : 10.1007/3-540-55610-9_167

E. Best, R. Devillers, and M. Koutny, Petri net algebra, 2013.
DOI : 10.1007/978-3-662-04457-5

A. Biere, A. Cimatti, E. Clarke, and Y. Zhu, Symbolic model checking without BDDs, 1999.
DOI : 10.21236/ada360973
URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=1426&context=compsci

V. Robert and . Binder, Testing object-oriented software : a survey Software Testing, Verification and Reliability, pp.125-252, 1996.

A. Bouajjani, J. Fernandez, S. Graf, C. Rodriguez, and J. Sifakis, Safety for branching time semantics, Automata , Languages and Programming, pp.76-92, 1991.
DOI : 10.1007/3-540-54233-7_126
URL : http://horus.imag.fr/Les.Personnes/Jean-Claude.Fernandez/./icalp91.ps.gz

P. Jonathan, . Bowen, G. Michael, and . Hinchey, Applications of formal methods, 1995.

D. Stephen, . Brookes, A. Charles, . Hoare, W. Andrew et al., A theory of communicating sequential processes, Journal of the ACM (JACM), vol.31, issue.3, pp.560-599, 1984.

E. Randal and . Bryant, Graph-based algorithms for boolean function manipulation . Computers, IEEE Transactions on, vol.100, issue.8, pp.677-691, 1986.

R. Jerry, E. M. Burch, . Clarke, L. Kenneth, . Mcmillan et al., Symbolic model checking : 10< sup> 20</sup> states and beyond. Information and computation, pp.142-170, 1992.

L. Calzone, L. Tournier, S. Fourquet, D. Thieffry, B. Zhivotovsky et al., Mathematical Modelling of Cell-Fate Decision in Response to Death Receptor Engagement, PLoS Computational Biology, vol.2006, issue.3, p.1000702, 2010.
DOI : 10.1371/journal.pcbi.1000702.s008
URL : https://hal.archives-ouvertes.fr/inserm-00704979

H. Carstensen and R. Valk, Infinite behaviour and fairness in petri nets, Advances in Petri nets 1984, pp.83-100, 1985.
DOI : 10.1007/3-540-15204-0_6

A. Cheng, J. Esparza, and J. Palsberg, Complexity results for 1-safe nets, Foundations of software technology and theoretical computer science, pp.326-337, 1993.
DOI : 10.1016/0304-3975(94)00231-7
URL : https://doi.org/10.1016/0304-3975(94)00231-7

S. Christensen and L. Petrucci, Modular Analysis of Petri Nets, The Computer Journal, vol.43, issue.3, pp.224-242, 2000.
DOI : 10.1093/comjnl/43.3.224

S. Christensen and L. Petrucci, Towards a modular analysis of coloured Petri nets, 1992.

E. Clarke, . Grumberg, X. Mcmillan, and . Zhao, E cient generation of counterexamples and witnesses in symbolic model checking, 1994.

M. Edmund, E. Clarke, and . Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, 1982.

E. M. Clarke, E. A. Emerson, and A. P. Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Transactions on Programming Languages and Systems, vol.8, issue.2, pp.244-263, 1986.
DOI : 10.1145/5397.5399

M. Edmund, R. Clarke, T. Enders, S. Filkorn, and . Jha, Exploiting symmetry in temporal logic model checking, Formal Methods in System Design, vol.9, issue.12, pp.77-104, 1996.

M. Edmund, O. Clarke, . Grumberg, E. David, and . Long, Model checking and abstraction, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.16, issue.5, pp.1512-1542, 1994.

D. Cofer, Model Checking: Cleared for Take Off, Model Checking Software, pp.76-87, 2010.
DOI : 10.1023/A:1011276507260

Y. , L. Cornec, and F. Pommereau, Modular ¯-calculus model-checking with formula-dependent hierarchical abstractions, 14th International Conference on Application of Concurrency to System Design , ACSD 2014, pp.11-20, 2014.
DOI : 10.1109/acsd.2014.14

G. Costa and C. Stirling, Weak and strong fairness in CCS, Information and Computation, vol.73, issue.3, pp.207-244, 1987.
DOI : 10.1016/0890-5401(87)90013-7
URL : https://doi.org/10.1016/0890-5401(87)90013-7

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/hal-01108790

P. Crouzen and H. Hermanns, Aggregation Ordering for Massively Compositional Models, 2010 10th International Conference on Application of Concurrency to System Design, pp.171-180, 2010.
DOI : 10.1109/ACSD.2010.28

P. Crouzen and F. Lang, Smart Reduction, Fundamental Approaches to Software Engineering, pp.111-126, 2011.
DOI : 10.1007/3-540-56689-9_54
URL : https://hal.archives-ouvertes.fr/inria-00572535

R. , D. Nicola, and F. Vaandrager, Three logics for branching bisimulation, Journal of the ACM (JACM), vol.42, issue.2, pp.458-487, 1995.

W. Edsger and . Dijkstra, Hierarchical ordering of sequential processes, Acta informatica, vol.1, issue.2, pp.115-138, 1971.

E. W. Edsger-wybe-dijkstra and . Dijkstra, Edsger Wybe Dijkstra, and Edsger Wybe Dijkstra. A discipline of programming, 1976.

E. Allen, E. , and P. Sistla, Symmetry and model checking. Formal methods in system design, pp.105-131, 1996.

A. Fauré, A. Naldi, F. Lopez, C. Chaouiya, A. Ciliberto et al., Modular logical modelling of the budding yeast cell cycle, Molecular BioSystems, vol.97, issue.2, pp.1787-1796, 2009.
DOI : 10.1007/978-3-540-44928-7_17

J. Fernandez and L. Mounier, ???On the fly??? verification of behavioural equivalences and preorders, Computer Aided Verification, pp.181-191, 1992.
DOI : 10.1007/3-540-55179-4_18

P. Godefroid, . Van-leeuwen, . Hartmanis, P. Goos, and . Wolper, Partial-order methods for the verification of concurrent systems : an approach to the state-explosion problem, volume 1032, 1996.
DOI : 10.1007/3-540-60761-7

H. Hansson and B. Jonsson, A logic for reasoning about time and reliability. Formal aspects of computing, pp.512-535, 1994.

D. Harel, D. Kozen, and J. Tiuryn, Dynamic logic, 2000.

M. Hennessy and R. Milner, On observing nondeterminism and concurrency, 1980.
DOI : 10.1007/3-540-10003-2_79

C. A. and R. Hoare, An axiomatic basis for computer programming, Communications of the ACM, vol.12, issue.10, pp.576-580, 1969.
DOI : 10.1145/363235.363259

C. A. and R. Hoare, Communicating sequential processes, Communications of the ACM, vol.21, issue.8, pp.666-677, 1978.
DOI : 10.1145/359576.359585

C. A. , R. Hoare, and H. Jifeng, Unifying theories of programming, 1998.

G. Holzmann, On-the-fly model checking, ACM Computing Surveys, vol.28, issue.4es, p.120, 1996.
DOI : 10.1145/242224.242379

K. Jensen, Coloured petri nets, 1987.
DOI : 10.1007/978-3-662-03241-1

R. Jhala and R. Majumdar, Software model checking, ACM Computing Surveys, vol.41, issue.4, p.21, 2009.
DOI : 10.1145/1592434.1592438

B. Cliff and . Jones, Specification and design of (parallel) programs, 1983.

J. Simon-peyton, Haskell 98 language and libraries : the revised report, 2003.

S. Katz and D. Peled, Verification of distributed programs using representative interleaving sequences, Distributed Computing, vol.11, issue.3, pp.107-120, 1992.
DOI : 10.1007/3-540-50403-6_37

W. David-kelton, M. Averill, and . Law, Simulation modeling and analysis, 2000.

G. John, J. L. Kemeny, and . Snell, Finite markov chains, 1960.

R. Koymans, Specifying real-time properties with metric temporal logic. Real-time systems, pp.255-299, 1990.
DOI : 10.1007/bf01995674

D. Kozen, Results on the propositional ??-calculus, Theoretical Computer Science, vol.27, issue.3, pp.333-354, 1983.
DOI : 10.1016/0304-3975(82)90125-6

A. Saul and . Kripke, Semantical analysis of modal logic i normal modal propositional calculi, Mathematical Logic Quarterly, vol.9, issue.56, pp.67-96, 1963.

C. Lakos and L. Petrucci, Modular analysis of systems composed of semiautonomous subsystems. In proc. of ACSD'04, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00003393

L. Lamport, Proving the correctness of multiprocess programs. Software Engineering, IEEE Transactions on, issue.2, pp.125-143, 1977.

L. Lamport, Specifying Concurrent Program Modules, ACM Transactions on Programming Languages and Systems, vol.5, issue.2, pp.190-222, 1983.
DOI : 10.1145/69624.357207

F. Lang and . Exp, open 2.0 : A flexible tool integrating partial order, compositional, and on-the-fly verification methods, Integrated Formal Methods, pp.70-88, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00070339

F. Lang and R. Mateescu, Partial Model Checking Using Networks of Labelled Transition Systems and Boolean Equation Systems, Tools and Algorithms for the Construction and Analysis of Systems, pp.141-156, 2012.
DOI : 10.1007/978-3-642-28756-5_11
URL : https://hal.archives-ouvertes.fr/hal-00684471

C. Lee, Representation of Switching Circuits by Binary-Decision Programs, Bell System Technical Journal, vol.38, issue.4, pp.985-999, 1959.
DOI : 10.1002/j.1538-7305.1959.tb01585.x

I. Lotos, A formal description technique based on the temporal ordering of observational behaviour. International Organisation for Standardization-Information Processing Systems-Open Systems Interconnection, 1988.

P. Martin-löf, Constructive Mathematics and Computer Programming, Studies in Logic and the Foundations of Mathematics, pp.153-175, 1982.
DOI : 10.1016/S0049-237X(09)70189-2

R. Mateescu and M. Sighireanu, Efficient on-the-fly model-checking for regular alternation-free mu-calculus, Science of Computer Programming, vol.46, issue.3, pp.255-281, 2003.
DOI : 10.1016/S0167-6423(02)00094-1
URL : https://hal.archives-ouvertes.fr/inria-00072755

E. Mayr, Persistence of vector replacement systems is decidable, Acta Informatica, vol.20, issue.3, pp.309-318, 1981.
DOI : 10.1007/BF00289268

L. Kenneth and . Mcmillan, Symbolic model checking, 1993.

D. Nuno, F. Mendes, Y. Lang, R. Cornec, G. Mateescu et al., Composition and abstraction of logical regulatory modules : application to multicellular systems, Bioinformatics, vol.29, issue.6, pp.749-757, 2013.

R. Milner, Communication and concurrency, 1989.

R. Milner, Communicating and mobile systems : the pi calculus, 1999.

R. Milner, R. Milner, R. Milner, and R. Milner, A calculus of communicating systems, 1980.
DOI : 10.1007/3-540-10235-3

C. John and . Mitchell, Foundations for programming languages, 1996.

T. Murata, Petri nets: Properties, analysis and applications, Proceedings of the IEEE, pp.541-580, 1989.
DOI : 10.1109/5.24143

A. Naldi, J. Carneiro, C. Chaouiya, and D. Thieffry, Diversity and Plasticity of Th Cell Types Predicted from Regulatory Network Modelling, PLoS Computational Biology, vol.212, issue.9, p.1000912, 2010.
DOI : 10.1371/journal.pcbi.1000912.s003
URL : https://hal.archives-ouvertes.fr/inserm-00704876

D. Park, Concurrency and automata on infinite sequences, Theoretical Computer Science, Lecture Notes in Computer Science, vol.104, pp.167-183, 1981.
DOI : 10.1007/BFb0017309
URL : http://wrap.warwick.ac.uk/47224/1/WRAP_Park_cs-rr-035.pdf

J. Parrow, Fairness properties in process algebra with applications in communication protocol verification, 1985.

D. Peled, Combining partial order reductions with on-the-fly model-checking, Computer aided verification, pp.377-390, 1994.

L. James and . Peterson, Petri nets, ACM Computing Surveys (CSUR), vol.9, issue.3, pp.223-252, 1977.

C. Adam and P. , Kommunikation mit automaten, 1962.

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

A. Pnueli, The temporal semantics of concurrent programs. Theoretical computer science, pp.45-60, 1981.

A. Pnueli, In Transition From Global to Modular Temporal Reasoning about Programs, 1985.
DOI : 10.1007/978-3-642-82453-1_5

F. Pommereau, Algebras of coloured Petri nets, and their applications to modelling and verification, 2010.

M. Prasanna, . Sn-sivanandam, R. Venkatesan, and . Sundarrajan, A survey on automatic test case generation, Academic Open Internet Journal, vol.15, issue.6, 2005.

R. Vaughan and . Pratt, Semantical consideration on floyo-hoare logic, 17th Annual Symposium on, pp.109-121, 1976.

C. Priami, Stochastic ??-Calculus, The Computer Journal, vol.38, issue.7, pp.578-589, 1995.
DOI : 10.1093/comjnl/38.7.578

J. Queille and J. Sifakis, Specification and verification of concurrent systems in CESAR, International Symposium on Programming, pp.337-351, 1982.
DOI : 10.1007/3-540-11494-7_22

L. Sánchez, C. Chaouiya, and D. Thieffry, Segmenting the fly embryo: logical analysis of the role of the Segment Polarity cross-regulatory module, The International Journal of Developmental Biology, vol.52, issue.8, p.521059, 2008.
DOI : 10.1387/ijdb.072439ls

L. Sanchez and D. Thieffry, Segmenting the fly embryo:, Journal of Theoretical Biology, vol.224, issue.4, pp.517-537, 2003.
DOI : 10.1016/S0022-5193(03)00201-7

K. Schneider, Verification of reactive systems : formal methods and algorithms, 2013.
DOI : 10.1007/978-3-662-10778-2

S. Shoham and O. Grumberg, Compositional verification and 3- valued abstractions join forces, Static Analysis, pp.69-86, 2007.
DOI : 10.1016/j.ic.2009.10.002
URL : https://doi.org/10.1016/j.ic.2009.10.002

A. Prasad-sistla, Deciding full branching time logic, 1984.

A. Prasad-sistla, On characterization of safety and liveness properties in temporal logic, Proceedings of the fourth annual ACM symposium on Principles of distributed computing, pp.39-48, 1985.

C. Stirling, Modal and temporal properties of processes, 2001.
DOI : 10.1007/978-1-4757-3550-5

E. Robert, S. Strom, and . Yemini, Typestate : A programming language concept for enhancing software reliability. Software Engineering, IEEE Transactions on, issue.1, pp.157-171, 1986.

C. Kuo, . Tai, V. Pramod, and . Koppol, Hierarchy-based incremental analysis of communication protocols, Network Protocols Proceedings ., 1993 International Conference on, pp.318-325, 1993.

R. Thomas, Regulatory networks seen as asynchronous automata: A logical description, Journal of Theoretical Biology, vol.153, issue.1, pp.1-23, 1991.
DOI : 10.1016/S0022-5193(05)80350-9

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.29, issue.2, pp.247-276, 1995.
DOI : 10.1007/978-3-642-49321-8_15

A. Mathison and T. , On computable numbers, with an application to the entscheidungsproblem, J. of Math, vol.58, pp.345-3635, 1936.

A. Valmari, A stubborn attack on state explosion, Computer-Aided Verification, pp.156-165, 1991.

R. J. Van-glabbeek and W. P. Weijland, Branching time and abstraction in bisimulation semantics, Journal of the ACM, vol.43, issue.3, pp.555-600, 1996.
DOI : 10.1145/233551.233556

J. Rob and . Van-glabbeek, Bounded nondeterminism and the approximation induction principle in process algebra, STACS 87, pp.336-347, 1987.

W. Visser, K. Havelund, and G. Brat, SeungJoon Park, and Flavio Lerda. Model checking programs, Automated Software Engineering, vol.10, issue.2, pp.203-232, 2003.
DOI : 10.1023/A:1022920129859

J. Wang, Timed Petri nets : Theory and application, 2012.

G. Winskel and M. Nielsen, Models for concurrency, DAIMI Report Series, vol.22, issue.463, 1993.
DOI : 10.7146/dpb.v21i429.6743

H. Xi and F. Pfenning, Dependent types in practical programming, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '99, pp.214-227, 1999.
DOI : 10.1145/292540.292560
URL : http://www.ececs.uc.edu/~hwxi/academic/papers/thesis.ps.gz