R. Et-compression-d-'´-etats and .. , 102 4.5.1 Exemple de la technique " state collapsing ", p.104

. Le-secondprobì-eme-est-que, par définition, certains flots positifs ne peuventêtrepeuventêtre calculés. Par exemple, un flot faisant intervenir trois couleurs différentes (X, X! and X!!) ou un flot utilisant le cardinal d'une classe comme poid (n 1 .X.F ) ne sont pas des flots simples et ainsi

L. Possibilité-de-répartir-l, exploration et le stockage de l'espace d'´ etat nous permet alors de franchir un cap dans la taille des modèle que l'on peut analyser

L. Travaux and . Ont, pour la plupart, comme objectif d'essayer de franchir de nouveaux paliers dans les possibilités d'analyse. Ainsi, il nous para??tpara??t important d'essayer d'enrichir notre outil en offrant la possibilité de stocker l'espace d'´ etat sur le disque dur ce qui nous

. De-même, les méthodes présentées pour l'adaptation des méthodes d'ordre partiel semblent inadéquates Que ce soit notre proviso ou celui de Spin, leur utilisationàutilisationà largé echelle sera vraisemblablement inefficace car générerá enormément de communications. L` a encore, seule la redondance et la duplication d'´ etat pourraient permettre d

G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, On wellformed coloured nets and their symbolic reachability graph, Proceedings of the 11th International Conference on Application and Theory of Petri Nets, pp.373-396, 1991.
DOI : 10.1007/978-3-642-84524-6_13

M. Diaz, Les Réseaux de Petri -Modèles Fondamentaux, HERMES Sciences Publications, vol.1, 2001.

J. Esparza and M. Nielsen, Decidability Issues for Petri Nets, BRICS Report Series, vol.1, issue.8, pp.244-262, 1994.
DOI : 10.7146/brics.v1i8.21662

J. Ezpeleta, F. García-vallés, and J. M. Colom, A Class of Well Structured Petri Nets for Flexible Manufacturing Systems, ICATPN '98 : Proceedings of the 19th International Conference on Application and Theory of Petri Nets, pp.64-83, 1998.
DOI : 10.1007/3-540-69108-1_5

S. Haddad, Une catégorierégulì ere de réseaux de Petri de haut niveau : définition, propriétés et réductions. ApplicationàApplication`Applicationà la validation de systèmes distribués, 1987.

P. Huber, K. Jensen, and R. M. Shapiro, Hierarchies in coloured petri nets, Proceedings of the 10th International Conference on Applications and Theory of Petri Nets, pp.313-341
DOI : 10.1007/3-540-53863-1_30

K. Jensen, Coloured Petri Nets and the Invariant-Method, DAIMI Report Series, vol.8, issue.104, pp.317-336, 1981.
DOI : 10.7146/dpb.v8i104.6519

K. Jensen, Coloured Petri Nets Basic Concepts, Analysis Methods and Practical Use, 1997.

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

J. M. Colom and M. Silva, Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal p-semiflows, APN 90 : Proceedings on Advances in Petri nets 1990, pp.79-112, 1991.
DOI : 10.1007/3-540-53863-1_22

J. Colom and F. Garcia-valles, Implicit places in net systems, Proceedings of the 8th International Workshop on Petri Net and Performance Models, pp.104-113, 1999.

J. M. Couvreur, S. Haddad, and J. F. Peyre, Computation of generative families of positive semi-flows in two types of coloured nets, Proceedings of the 12th International Conference on Application and Theory of Petri Nets, pp.122-144, 1991.
URL : https://hal.archives-ouvertes.fr/hal-01124761

J. M. Couvreur, S. Haddad, and J. F. Peyre, Generative families of positive invariants in Coloured nets sub-classes, Lecture Notes in Computer Science, vol.674, pp.51-70, 1993.
DOI : 10.1007/3-540-56689-9_39

J. M. Couvreur, The general computation of flows for coloured nets, proc of the 11th International Conference on Application and Theory of Petri-Nets, 1990.

J. M. Couvreur and S. Haddad, Towards a general and powerful computation of flows for parameterized coloured nets, 9th European Workshop on Application and Theory of Petri Nets, 1988.

S. Evangelista, S. Haddad, and J. Pradat-peyre, New coloured reductions for software validation, Proccedings of the 7th International workshop on discrete event systems, pp.355-360, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01124921

S. Evangelista, S. Haddad, and J. Pradat-peyre, Syntactical Colored Petri Nets Reductions, Proccedings of the Third International Symposium on Automated Technology for Verification and Analysis, pp.202-216, 2005.
DOI : 10.1007/11562948_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.6477

S. Evangelista, C. Pajault, and J. Pradat-peyre, A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets, FORTE, pp.177-195, 2007.
DOI : 10.1109/5.24143
URL : https://hal.archives-ouvertes.fr/hal-01125308

H. J. Genrich and K. Lautenbach, S-invariance in predicate/transition nets Informatik-Fachberichte 66 : Application and Theory of Petri Nets ? Selected Papers from the Third European Workshop on Application and Theory of Petri Nets, pp.98-111, 1982.

S. Haddad and C. Girault, Algebraic structure of flows of a regular coloured net. Lecture Notes in Computer Science : Advances in Petri Nets, pp.73-88, 1987.

S. Haddad and J. Pradat-peyre, New Efficient Petri Nets Reductions for Parallel Programs Verification, Parallel Processing Letters, vol.16, issue.01, p.16, 2006.
DOI : 10.1142/S0129626406002502
URL : https://hal.archives-ouvertes.fr/hal-01125149

G. Memmi and J. Vautherin, Computation of flows for unary-predicates/transition nets. Lecture Notes in Computer Science : Advances in Petri Nets, pp.455-467, 1984.

D. Poitrenaud and J. Pradat-peyre, Pre- and Post-agglomerations for LTL Model Checking, Proceedings of the 21st International Conference on Application and Theory of Petri Nets, pp.387-408
DOI : 10.1007/3-540-44988-4_22

W. Reisig, EATCS-An Introduction to Petri Nets, 1983.

W. Reisig, Petri nets and algebraic specifications, Theoretical Computer Science, vol.80, issue.1, pp.1-34, 1991.
DOI : 10.1016/0304-3975(91)90203-E
URL : http://doi.org/10.1016/0304-3975(91)90203-e

M. S. Suarez, J. Martinez, P. Ladet, and H. Alla, Generalized inverses and the calculation of symbolic invariants for colored petri nets, Technique et Science Informatiques, vol.421, issue.1, pp.113-126, 1985.

J. Vautherin, Calculation of semi-flows for pr/T-systems, In Int. Workshop on Petri Nets and Performance Models, pp.174-183, 1987.

G. Chiola, G. Franceschinis, and R. Gaeta, A symbolic simulation mechanism for well-formed coloured Petri nets, Proceedings. 25th Annual Simulation Symposium, pp.192-201, 1992.
DOI : 10.1109/SIMSYM.1992.227562

E. M. Clarke, Orna Grumberg, and Doron Peled. Model Checking, 1999.

S. Evangelista, Méthodes et outils de vérification pour les réseaux de Petri de haut niveau. ApplicationàApplication`Applicationà la vérification de programmes Ada concurrents, Conservatoire National des Arts et Métiers, 2006.

J. Geldenhuys, State Caching Reconsidered, Proceedings of the 8th International SPIN Workshop on Model Checking of Software, pp.23-38, 2004.
DOI : 10.1007/978-3-540-24732-6_3

P. Godefroid, G. J. Holzmann, and D. Pirottin, State space caching revisited, Proceedings of the Fourth International Workshop on Computer Aided Verification, pp.178-191, 1992.
DOI : 10.1007/3-540-56496-9_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.3630

J. Gerard and . Holzmann, State compression in spin : Recursive indexing and compression training runs, Proceedings of the Third Spin Workshop, 1997.

T. Basten and D. Bosnacki, Enhancing partial-order reduction via process clustering, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001), pp.245-253, 2001.
DOI : 10.1109/ASE.2001.989810
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.3462

D. Bosnacki, S. Leue, and A. Lluch-lafuente, Partial-Order Reduction for General State Exploring Algorithms, Proceedings of the 13th International SPIN Workshop, pp.271-287, 2006.
DOI : 10.1007/3-540-65306-6_21

D. Bosnacki and G. J. Holzmann, Improving Spin???s Partial-Order Reduction for Breadth-First Search, Proceedings of the 12th International SPIN Workshop on Model Checking of Software, pp.91-105
DOI : 10.1007/11537328_10

E. M. Clarke, O. Grumberg, M. Minea, and D. Peled, State space reduction using partial order techniques, International Journal on Software Tools for Technology Transfer (STTT), vol.2, issue.3, pp.279-287, 1999.
DOI : 10.1007/s100090050035
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.8389

S. Edelkamp, S. Leue, and A. Lluch-lafuente, Directed explicit-state model checking in the validation of communication protocols, International Journal on Software Tools for Technology Transfer, vol.2, issue.2-3, pp.247-267, 2004.
DOI : 10.1007/s100090050042

S. Evangelista and C. Pajault, Some Solutions to the Ignoring Problem, Lecture Notes in Computer Science, pp.76-94, 2007.
DOI : 10.1007/978-3-540-73370-6_7
URL : https://hal.archives-ouvertes.fr/hal-00144876

C. Flanagan and P. Godefroid, Dynamic partial-order reduction for model checking software, Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.110-121, 2005.

P. Godefroid, Partial-Order Methods for the Verification of Concurrent Systems -An Approach to the State-Explosion Problem, volume 1032 of Lecture Notes in Computer Science, 1996.

P. Godefroid, Partial-Order Methods for the Verification of Concurrent Systems, 1994.
DOI : 10.1007/3-540-60761-7

P. Godefroid and P. Wolper, Using partial orders for the efficient verification of deadlock freedom and safety properties, Proceedings of the Third International Workshop on Computer Aided Verification, pp.332-342, 1991.
DOI : 10.1007/3-540-55179-4_32

P. Godefroid and P. Wolper, Partial-order methods for temporal verification, Proceedings of the 4th International Conference on Concurrency Theory, pp.233-246, 1993.

J. Gerard, D. Holzmann, and . Peled, An improvement in formal verification, Proceedings of the 7th International Conference on Formal Description Techniques, pp.197-211, 1994.

R. P. Kurshan, V. Levin, and M. Minea, Doron Peled, and Hüsnü Yenigün Static partial order reduction, TACAS '98 : Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems, pp.345-357, 1998.
DOI : 10.1007/bfb0054182

R. Nalumasu and G. Gopalakrishnan, An efficient partial order reduction algorithm with an alternative proviso implementation. Form, Formal Methods in System Design, vol.20, issue.3, pp.231-247, 2002.
DOI : 10.1023/A:1014728912264

D. Peled, All from one, one for all: on model checking using representatives, Proceedings of the 5th International Conference on Computer Aided Verification, pp.409-423, 1993.
DOI : 10.1007/3-540-56922-7_34

P. Ribet, F. Vernadat, and B. Berthomieu, Graphe de pas persistant, Journées FAC'2002. Formalisation des Activités Concurrentes, p.15, 2002.

P. Ribet, F. Vernadat, and B. Berthomieu, On Combining the Persistent Sets Method with the Covering Steps Graph Method, Proceedings of the 22th International Conference on Formal Methods for Networked and Distributed Systems, pp.344-359, 2002.
DOI : 10.1007/3-540-36135-9_22

A. Valmari, Error detection by reduced reachability graph generation, Proceedings of the 9th European Workshop on Application and Theory of Petri Nets, pp.95-112, 1988.

A. Valmari, State Space Generation : Efficiency and Practicality, 1988.

A. Valmari, Eliminating redundant interleavings during concurrent program verification, Parallel Architectures and Languages Europe, pp.89-103, 1989.
DOI : 10.1007/3-540-51285-3_35

A. Valmari, A stubborn attack on state explosion, Proceedings of the second International Workshop on Computer Aided Verification, pp.156-165, 1990.
DOI : 10.1007/BFb0023729

A. Valmari, Stubborn sets for reduced state space generation, Proceedings of the 10th International Conference on Application and Theory of Petri Nets, pp.491-515, 1991.
DOI : 10.1007/3-540-53863-1_36

A. Valmari, On-the-fly verification with stubborn sets, Proceedings of the 5th International Conference on Computer Aided Verification, 1993.
DOI : 10.1007/3-540-56922-7_33

A. Valmari, State of the art report : Stubborn sets. Petri Net Newsletter, pp.6-14, 1994.

K. Varpaaniemi, Efficient detection of deadlock in Petri nets. Licentiate's thesis, 1993.

K. Varpaaniemi, On combining the stubborn set method with the sleep set method, Proceedings of the 15th International Conference on Application and Theory of Petri Nets, pp.548-567, 1994.
DOI : 10.1007/3-540-58152-9_30

K. Varpaaniemi, On the Stubborn Set Method in Reduced State Space Generation, 1998.

F. Vernadat, P. Azéma, and F. Michel, Covering step graph, Proceedings of the 17th International Conference on Application and Theory of Petri Nets, pp.516-535, 1996.
DOI : 10.1007/3-540-61363-3_28

F. Vernadat and F. Michel, Covering step graph preserving failure semantics, Proceedings of the 18th International Conference on Application and Theory of Petri Nets, pp.253-270, 1997.
DOI : 10.1007/3-540-63139-9_40
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.3460

]. R. Alur, R. K. Brayton, T. A. Henzinger, S. Qadeer, and S. K. Rajamani, Partial-order reduction in symbolic state space exploration, Model-Checking symbolique Proceedings of the 9th International Conference on Computer Aided Verification, pp.340-351, 1997.
DOI : 10.1007/3-540-63166-6_34

R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.677-691, 1986.
DOI : 10.1109/TC.1986.1676819

J. R. Burch, E. M. Clarke, D. L. Dill, L. J. Hwang, and K. Mcmillan, Symbolic model checking: 10/sup 20/ states and beyond, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.428-439, 1990.
DOI : 10.1109/LICS.1990.113767

K. Mcmillan, Symbolic Model Checking BIBLIOGRAPHIE Model-Checkingparalì ele et réparti [69] Gerd Behrmann, Thomas Hune, and Frits W. Vaandrager. Distributing timed model checking -how the search order matters, CAV '00 : Proceedings of the 12th International Conference on Computer Aided Verification, pp.216-231, 1992.

A. Bell, R. Boudewijn, and . Haverkort, Sequential and Distributed Model Checking of Petri Net Specifications, Electronic Notes in Theoretical Computer Science, vol.68, issue.4, 2002.
DOI : 10.1016/S1571-0661(05)80391-3

A. Bell, R. Boudewijn, and . Haverkort, Distributed disk-based algorithms for model checking very large Markov chains, Formal Methods in System Design, vol.29, issue.2, pp.177-196, 2006.
DOI : 10.1007/s10703-006-0007-0

B. Bollig, M. Leucker, and M. Weber, Local Parallel Model Checking for the Alternation-Free ??-Calculus, Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN '02, 2002.
DOI : 10.1007/3-540-46017-9_11

V. Braberman, A. Olivero, and F. Schapachnik, Issues in distributed timed model checking, International Journal on Software Tools for Technology Transfer, vol.21, issue.1, pp.4-18, 2005.
DOI : 10.1007/s10009-004-0143-z

W. J. Knottenbelt, M. Mestern, P. G. Harrison, and P. S. Kritzinger, Probability, Parallelism and the State Space Exploration Problem, Computer Performance Evaluation (Tools), pp.165-179, 1998.
DOI : 10.1007/3-540-68061-6_14

I. Melatti, R. Palmer, G. Sawaya, Y. Yang, R. M. Kirby et al., Parallel and distributed model checking in Eddy, SPIN, pp.108-125, 2006.

G. Ciardo, J. Gluckman, and D. Nicol, Distributed State Space Generation of Discrete-State Stochastic Models, INFORMS Journal on Computing, vol.10, issue.1, pp.82-93, 1998.
DOI : 10.1287/ijoc.10.1.82

G. Ciardo and D. M. Nicol, Automated parallelization of discrete state-space generation, 2000.

R. Kumar, M. D. Jones, and E. G. Mercer, Dynamic partition algorithm for distributed murphi, 2004.

R. Kumar and E. G. Mercer, Load Balancing Parallel Explicit State Model Checking, Parallel and Distributed Model Checking, 2004.
DOI : 10.1016/j.entcs.2004.10.016
URL : http://doi.org/10.1016/j.entcs.2004.10.016

F. Lerda and R. Sisto, Distributed-Memory Model Checking with SPIN, Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking, pp.22-39, 1999.
DOI : 10.1007/3-540-48234-2_3

F. Lerda and W. Visser, Addressing dynamic issues of program model checking, SPIN '01 : Proceedings of the 8th international SPIN workshop on Model checking of software, pp.80-102, 2001.
DOI : 10.1007/3-540-45139-0_6

L. Petrucci and L. M. Kristensen, An approach to distributed state space exploration for coloured petri nets, 25th International Conference on Application and Theory of Petri Nets, pp.474-483, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00003392

U. Stern and D. L. Dill, Parallelizing the murphi verifier, CAV '97 : Proceedings of the 9th International Conference on Computer Aided Verification, pp.256-278, 1997.

L. Brim, I. Cerná, P. Moravec, and J. Sim?a, Distributed Partial Order Reduction of State Spaces, 3rd International Workshop on Parallel and Distributed Methods in verifiCation, 2004.
DOI : 10.1016/j.entcs.2004.10.019

R. Palmer and G. Gopalakrishnan, Partial order reduction assisted parallel model checking, Proc. Parallel and Distributed Model Checking (PDMC) Workshop, 2002.

M. C. Checkingparalì-ele86-]-s, M. Allmaier, G. Kowarschik, and . Horton, State space construction and steady?state solution of gspns on a shared?memory multiprocessor, PNPM '97 : Proceedings of the 6th International Workshop on Petri Nets and Performance Models, p.112, 1997.

J. Barnat, L. Brim, and P. Ro?kai, Scalable Multi-core LTL Model-Checking, Model Checking Software, pp.187-203, 2007.
DOI : 10.1007/978-3-540-73370-6_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.3950

S. Caselli, G. Conte, and P. Marenzoni, Parallel state space exploration for GSPN models, Proceedings of the 16th International Conference on Application and Theory of Petri Nets, pp.181-200, 1995.
DOI : 10.1007/3-540-60029-9_40

J. Gerard and . Holzmann, A stack-slicing algorithm for multi-core model checking, Electron. Notes Theor. Comput. Sci, vol.198, issue.1, pp.3-16, 2008.

G. J. Holzmann and D. Bosnacki, Multi-Core Model Checking with SPIN, 2007 IEEE International Parallel and Distributed Processing Symposium, 2007.
DOI : 10.1109/IPDPS.2007.370410
URL : http://repository.tue.nl/661333

J. Barnat, L. Brim, and J. Chaloupka, Parallel breadth-first search ltl modelchecking, pp.106-115, 2003.
DOI : 10.1109/ase.2003.1240299
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.3713

L. Brim and J. Barnat, Distribution of Explicit-State LTL Model-Checking, 8th International Workshop on Formal Methods for Industrial Critical Systems (FMICS 03), 2003.
DOI : 10.1016/S1571-0661(04)80825-9

L. Brim, P. Ivana?ernáivana?ivana?erná, R. Kr?ál, and . Pelánek, Distributed LTL Model Checking Based on Negative Cycle Detection, Lecture Notes in Computer Science, vol.2245, pp.96-107, 2001.
DOI : 10.1007/3-540-45294-X_9

L. Brim, J. Barnat, and J. Stríbrná, Distributed LTL model-checking in SPIN, Proceedings of the 8th international SPIN workshop on Model checking of software, pp.200-216

S. Ben-david, T. Heyman, O. Grumberg, and A. Schuster, Scalable distributed on-the-fly symbolic model checking, Model checking symbolique [96] FMCAD '00 : Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design, pp.390-404, 2000.

O. Grumberg, T. Heyman, and A. Schuster, A work-efficient distributed algorithm for reachability analysis, Formal Methods in System Design, vol.29, issue.2, pp.157-175, 2006.
DOI : 10.1007/s10703-006-0011-4

T. Heyman, D. Geist, O. Grumberg, and A. Schuster, Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits, CAV, pp.20-35, 2000.
DOI : 10.1007/10722167_6

T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, Lazy abstraction, Proceedings of the 29th Symposium on Principles of Programming Languages, pp.58-70, 2002.
DOI : 10.1145/565816.503279

C. Kaiser, C. Pajault, and J. Pradat-peyre, Modelling Remote Concurrency with Ada, Proceedings 12th International Conference on Reliable Software Technologies, pp.192-207, 2007.
DOI : 10.1007/978-3-540-73230-3_15
URL : https://hal.archives-ouvertes.fr/hal-01125309

C. Kaiser, C. Pajault, and J. , Pradat-Peyre. Concurrent program metrics drawn by Quasar, 13th Int. Conf on Reliable Software Technologie, 2008.

P. Rousseau, Découpe de programmes concurrents en vue de leur vérification, Conservatoire National des Arts et Métiers, 2006.

P. Rousseau, A New Approach for Concurrent Program Slicing, Proceedings of the 26th International Conference on Formal Methods for Networked and Distributed Systems, pp.228-242, 2006.
DOI : 10.1145/1050849.1050865

T. Andrews, S. Qadeer, S. K. Rajamani, J. Rehof, and Y. Xie, Zing: A Model Checker for Concurrent Software, 2004.
DOI : 10.1007/978-3-540-27813-9_42

T. Ball and S. K. Rajamani, The slam project : debugging system software via static analysis, Proceedings of the 29th Symposium on Principles of Programming Languages, pp.1-3, 2002.

G. Chiola, G. Franceschinis, R. Gaeta, and M. Ribaudo, Greatspn 1.7 : Graphical editor and analyzer for timed and stochastic Petri nets. Performance Evaluation, pp.47-68, 1995.

A. Cimatti, E. M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore et al., NuSMV 2: An OpenSource Tool for Symbolic Model Checking, Proceedings of the Fourth International Workshop on Computer Aided Verification, pp.359-364, 2002.
DOI : 10.1007/3-540-45657-0_29

C. Demartini, R. Iosif, and R. Sisto, dSPIN: A Dynamic Extension of SPIN, Proceedings of the 6th International SPIN Workshop on Model Checking of Software, pp.261-276, 1999.
DOI : 10.1007/3-540-48234-2_20

S. Edelkamp, A. Lluch-lafuente, and S. Leue, Directed explicit model checking with HSF-SPIN, Proceedings of the 8th International SPIN Workshop on Model Checking of Software, pp.57-79, 2001.
DOI : 10.1007/3-540-45139-0_5

S. Evangelista, High Level Petri Nets Analysis with Helena, Proceedings of the 25th International Conference on Application and Theory of Petri Nets, pp.455-464, 2005.
DOI : 10.1007/11494744_26
URL : https://hal.archives-ouvertes.fr/hal-00149528

S. Evangelista, C. Kaiser, C. Pajault, J. Pradat-peyre, and P. Rousseau, Dynamic Tasks Verification with Quasar, Proceedings of the 10th Ada- Europe International Conference on Reliable Software Technologies, pp.91-104, 2005.
DOI : 10.1007/11499909_8

S. Evangelista, C. Kaiser, J. Pradat-peyre, and P. Rousseau, Quasar: A New Tool for Concurrent Ada Programs Analysis, Proceedings of the 8th Ada-Europe International Conference on Reliable Software Technologies, pp.168-181, 2003.
DOI : 10.1007/3-540-44947-7_12

P. Godefroid, Model checking for programming languages using VeriSoft, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.174-186, 1997.
DOI : 10.1145/263699.263717

P. Godefroid, Software Model Checking: The VeriSoft Approach, Formal Methods in System Design, vol.3, issue.2, 2003.
DOI : 10.1007/s10703-005-1489-x

K. Havelund and T. Pressburger, Model checking java programs using java pathfinder . Software Tools for Technology Transfer, pp.366-381, 2000.
DOI : 10.1007/s100090050043
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.7274

T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, Software Verification with BLAST, Proceedings of the 10th International SPIN Workshop on Model Checking of Software, pp.235-239
DOI : 10.1007/3-540-44829-2_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.6477

J. Gerard and . Holzmann, The model checker spin, IEEE Transactions on Software Engineering, vol.23, issue.5, pp.279-295, 1997.

J. Gerard and . Holzmann, The model checker SPIN, Software Engineering, vol.23, issue.5, pp.279-295, 1997.

L. Kenneth and . Mcmillan, The smv system, 1992.

C. Pajault, Extending quasar with dynamic tasks computation, Conservatoire National des Arts et Métiers, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01124951

W. Visser and P. C. Mehlitz, Model Checking Programs with Java PathFinder, Proceedings of the 12th International SPIN Workshop on Model Checking of Software, p.27, 2005.
DOI : 10.1007/11537328_5

M. Maged, M. L. Michael, and . Scott, Simple, fast, and practical non-blocking and blocking concurrent queue algorithms, PODC '96 : Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, pp.267-275, 1996.

J. Bacon, Concurrent Systems : Operating Systems, Database and Distributed Systems : An Integrated Approach, 1997.

E. W. Dijkstra, Shmuel safra's version of termination detection, 1987.

E. Dijkstra, W. Feijen, and A. Van-gasteren, Derivation of a termination detection algorithm for distributed computations, Proc. of the NATO Advanced Study Institute on Control flow and data flow : concepts of distributed programming, pp.507-512, 1986.

K. Ahmed and . Elmagarmid, A survey of distributed deadlock detection algorithms, SIGMOD Rec, vol.15, issue.3, pp.37-45, 1986.

F. Mattern, Algorithms for distributed termination detection, Distributed Computing, pp.161-175, 1987.
DOI : 10.1007/BF01782776

J. Misra, Detecting termination of distributed computations using markers, Proceedings of the second annual ACM symposium on Principles of distributed computing , PODC '83, pp.290-294, 1983.
DOI : 10.1145/800221.806729

G. Tel, Introduction to Distributed Algorithms, 2001.
DOI : 10.1017/CBO9781139168724
URL : http://dx.doi.org/10.1016/s0898-1221(97)90063-8

D. Zöbel, The Deadlock problem, ACM SIGOPS Operating Systems Review, vol.17, issue.4, pp.6-15, 1983.
DOI : 10.1145/850752.850753

P. Breguet and L. Zaffalon, Programmation concurrente et temps réel avec ADA 95, Presses polytechniques et universitaires romandes, 2003.

A. Burns and A. Wellings, Concurrency in Ada, 1995.

L. K. Dillon, A visual execution model for Ada tasking, ACM Transactions on Software Engineering and Methodology, vol.2, issue.4, pp.311-345, 1993.
DOI : 10.1145/158431.158432

L. K. Dillon, Task dependence and termination in Ada, ACM Transactions on Software Engineering and Methodology, vol.6, issue.1, pp.80-110, 1997.
DOI : 10.1145/237432.237459

. Divers, YAHODA Verification Tools Database

C. Eisner and D. Peled, Comparing Symbolic and Explicit Model Checking of a Software System, Proceedings of the 9th International SPIN Workshop on Model Checking of Software, pp.230-239, 2002.
DOI : 10.1007/3-540-46017-9_18

P. Godefroid, The soundness of bugs is what matters, Proceedings of the Workshop on the Evaluation of Software Defect Detection Tools, 2005.

M. Mäkelä, Applying compiler techniques to reachability analysis of high-level models, Proceedings of the Workshop on Concurrency, Specification and Programming, pp.129-142, 2000.

S. Sahni and E. Horowitz, Fundamentals of Data Structures, 1976.

A. Valmari, The state explosion problem In Lectures on Petri Nets I : Basic Models, volume 1491 of Lecture Notes in Computer Science, pp.429-528, 1998.

. Dans-cette-annexe, nous présentons les résultats expérimentaux obtenus par Cyclades. Ces résultats nous ont permis de créer les graphes et courbes présentés dans cette thèse

. Pour-chaque-modèle, nous donnons : ? le nombre de noeuds utilisés pour l'exploration (n ) ? l'´ ecart-type obtenu comparécomparéà une répartition optimale (lorsque le nombre d'´ etats estégalementestégalement réparti sur chacun des noeuds) noté (?) ? le nombre d'´ etat stockés sur la partition de plus petite et de plus grand taille

. Pour-chaque-modèle, nous donnons ici le temps d'exécution (time) exprimé en secondes ainsi que le ratio, c'est-` a-dire le gain de temps obtenu donné par la formule : temps réparti temps séquentiel