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

S. Allmaier, S. Dalibor, and D. Kreische, Parallel Graph Generation Algorithms for Shared and Distributed Memory Machines, Proceedings of the Parallel Computing Conference PARCO, pp.207218-207244, 1997.
DOI : 10.1016/S0927-5452(98)80074-9

S. Allmaier, M. Kowarschik, and G. Horton, State space construction and steady-state solution of GSPNs on a shared-memory multiprocessor, Proceedings of the Seventh International Workshop on Petri Nets and Performance Models
DOI : 10.1109/PNPM.1997.595542

F. Vernadat, B. Berthomieu, and P. Ribet, The tool TINA construction of abstract state spaces for petri nets and time petri nets, International Journal of Production Research, issue.14, pp.42-149, 2004.

J. Barnat, L. Brim, and I. Cerna, Property driven distribution of nested DFS, Proc. Workshop on Verication and Computational Logic, pp.110-141, 2002.

J. Barnat, L. Brim, and J. Chaloupka, Parallel breadth-rst search LTL model-checking, Automated Software Engineering, 2003. Proceedings. 18th IEEE International Conference on, pp.115-149, 2003.
DOI : 10.1109/ase.2003.1240299
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.3713

L. [. Barnat, M. Brim, P. Ceska, and . Rockai, DiVinE: parallel distributed model checker (Tool paper) In Parallel and Distributed Methods in Verication and High Performance Computational Systems Biology, Brim, and P. Rockai. Scalable multi-core LTL Model- Checking, pp.47-89, 2010.

J. Barnat, L. Brim, and P. Rockai, A Time-Optimal On-the-Fly Parallel Algorithm for Model Checking of Weak LTL Properties, Formal Methods and Software Engineering, pp.407425-407460, 2009.
DOI : 10.1007/978-3-642-10373-5_21

J. Barnat, L. Brim, and J. Stribrna, Distributed LTL modelchecking in SPIN, Model Checking Software, pp.31-34, 2001.

L. Brim, I. Cerna, P. Krcal, and R. Pelanek, Distributed LTL Model Checking Based on Negative Cycle Detection, FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, pp.96107-96117, 2001.
DOI : 10.1007/3-540-45294-X_9

. R. Bcl-+-94-]-j, E. M. Burch, D. E. Clarke, K. L. Long, D. L. Mcmillan et al., Symbolic model checking for sequential circuit verication. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, vol.13, issue.2, pp.401-424, 1994.

L. Brim, I. Cerna, P. Moravec, and J. Simsa, Accepting Predecessors Are Better than Back Edges in Distributed LTL Model-Checking, Formal Methods in Computer-Aided Design, pp.352366-352400, 2004.
DOI : 10.1007/978-3-540-30494-4_25

L. Brim, J. Crhová, and K. Yorav, Using Assumptions to Distribute CTL Model Checking, Electronic Notes in Theoretical Computer Science, vol.68, issue.4, pp.559-574, 2002.
DOI : 10.1016/S1571-0661(05)80758-3

G. Behrmann, A. David, and K. G. Larsen, A Tutorial on Uppaal, Formal Methods for the Design of Real-Time Systems: 4th International School on Formal Methods for the Design of Computer, Communication, and Software Systems , SFM-RT 2004, pp.200236-82, 2004.
DOI : 10.1007/978-3-540-30080-9_7

A. Bell, R. Boudewijn, and . Haverkort, Sequential and distributed model checking of Petri nets, International Journal on Software Tools for Technology Transfer, vol.science, issue.1, pp.4360-4405, 2004.
DOI : 10.1007/s10009-003-0129-2

G. Behrmann, T. Hune, and F. Vaandrager, Distributing timed model checkinghow the search order matters, Computer aided verication, pp.216231-216256, 2000.

H. Burton and . Bloom, Space/time trade-os in hash coding with allowable errors, Commun. ACM, vol.13, issue.38, pp.422426-185, 1970.

B. Bollig, M. Leucker, and M. Weber, Parallel Model Checking for the Alternation Free ??-Calculus, Tools and Algorithms for the Construction and Analysis of Systems , volume 2031 of Lecture Notes in Computer Science, p.543558
DOI : 10.1007/3-540-45319-9_37

B. Bollig, M. Leucker, and M. Weber, Local Parallel Model Checking for the Alternation-Free ??-Calculus, Model Checking Software, pp.501522-501532, 2002.
DOI : 10.1007/3-540-46017-9_11

. Wilson, Hoard: a scalable memory allocator for multithreaded applications

S. Not, Network applications of bloom lters: A survey, In Internet Mathematics, vol.35, issue.38, pp.117128-169, 2000.

[. Ben-ari, A. Pnueli, and Z. Manna, The temporal logic of branching time

J. Barnat and P. Rockai, Shared hash tables in parallel model checking Electronic Notes in Theoretical Computer Science, Proceedings of the 6th International Workshop on Parallel and Distributed Methods in veriCation, pp.79-91, 2007.

D. R. Butenhof, Programming with POSIX threads, p.169, 1997.

+. and ]. J. Crow, NASA formal methods specication and analysis guidebook for the verication of software and computer systems, volume II: a practitioner's companion. NASA oce of safety and mission assurance, p.182, 1998.

S. Caselli, G. Conte, and P. Marenzoni, A Distributed Algorithm for GSPN Reachability Graph Generation, Journal of Parallel and Distributed Computing, vol.61, issue.1, pp.79-95, 2001.
DOI : 10.1006/jpdc.2000.1664

E. M. Clarke and E. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, Logics of Programs, pp.14-16, 1982.

E. M. Clarke, E. A. Emerson, and A. P. Sistla, Automatic verication of nite-state concurrent systems using temporal logic specications, ACM Transactions on Programming Languages and Systems, vol.8, issue.106, pp.244263-244299, 1986.

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.8293-8317, 1998.
DOI : 10.1287/ijoc.10.1.82

J. Bernard-chazelle, R. Kilian, A. Rubinfeld, and . Tal, The bloomier lter: an ecient data structure for static support lookup tables, Proceedings of the fteenth annual ACM-SIAM symposium on Discrete algorithms, p.38, 2004.

E. Clarke, Model checking, pp.16-88, 1999.

E. M. Clarke, The Birth of Model Checking, 25 Years of Model Checking, p.126, 2008.
DOI : 10.1007/978-3-540-69850-0_1

S. Cohen and Y. Matias, Spectral bloom lters, Proceedings of the 2003 ACM SIGMOD international conference on Management of data, SIGMOD '03, pp.241252-241290, 2003.

I. Cerna and R. Pelanek, Distributed explicit fair cycle detection (Set based approach), Model Checking Software, pp.623623-623633, 2003.

C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis, Memoryecient algorithms for the verication of temporal properties. Formal Methods in System Design, pp.275288-80, 1007.

P. Dillinger and P. Manolios, Bloom lters in probabilistic verication Formal Methods in Computer-Aided Design, Lecture Notes in Computer Science, vol.3312, issue.37, pp.367381978-367381981, 1007.

E. Emerson and E. Clarke, Characterizing correctness properties of parallel programs using xpoints, Jaco de Bakker and

E. Emerson, C. Jutla, and A. Sistla, On model-checking for fragments of µ-calculus, Lecture Notes in Computer Science, vol.697, issue.36, pp.385396-81, 1993.

H. El-rewini, Advanced computer architecture and parallel processing, p.21, 2004.
DOI : 10.1002/0471478385

J. Ezekiel and G. Luttgen, Measuring and evaluating parallel State-Space exploration algorithms Electronic Notes in Theoretical Computer Science, Proceedings of the 6th International Workshop on Parallel and Distributed Methods in veriCation, pp.47-61, 2007.

K. Fisler, R. Fraer, G. Kamhi, M. Vardi, and Z. Yang, Is There a Best Symbolic Cycle-Detection Algorithm?, Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of Lecture Notes in Computer Science, p.420
DOI : 10.1007/3-540-45319-9_29

R. Greenlaw, H. J. Hoover, and W. L. Ruzzo, Limits to Parallel Computation: P-Completeness Theory, p.38, 1995.

H. Garavel, R. Mateescu, and I. Smarandache, Parallel state space construction for model-checking, Model Checking Software, p.217234, 2001.
DOI : 10.1007/3-540-45139-0_14
URL : https://hal.archives-ouvertes.fr/inria-00072247

T. Gautier, J. Roch, and G. Villard, Regular versus irregular problems and algorithms, Parallel Algorithms BIBLIOGRAPHY for Irregularly Structured Problems, p.125, 1995.
DOI : 10.1007/3-540-60321-2_1

J. Gerard, D. Holzmann, and . Bosnacki, The design of a multicore extension of the SPIN model checker, IEEE Transactions on Software Engineering, vol.33, issue.42, pp.659674-659705, 2007.

B. Haverkort, A. Bell, and H. Bohnenkamp, On the ecient sequential and distributed generation of very large markov chains from stochastic petri nets, Petri Nets and Performance Models Proceedings. The 8th International Workshop on, pp.1221-1246, 1999.

G. J. Holzmann, R. Joshi, and A. Groce, Swarm verication, Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering, ASE '08, pp.16-32, 2008.

G. Holzmann, R. Joshi, and A. Groce, Tackling large verication problems with the swarm tool, Model Checking Software, p.134143, 2008.

A. Hamez, F. Kordon, Y. Thierry-mieg, and F. , dmcG: A Distributed Symbolic Model Checker Based on GreatSPN, Petri Nets and Other Models of Concurrency ICATPN 2007, pp.495504-495530, 2007.
DOI : 10.1007/978-3-540-73094-1_29
URL : https://hal.archives-ouvertes.fr/hal-00701513

G. J. Holzmann, Design and validation of protocols: a tutorial, Computer Networks and ISDN Systems, vol.25, issue.9, pp.981-1017, 1993.
DOI : 10.1016/0169-7552(93)90095-L

. Hol08, J. Gerard, and . Holzmann, A Stack-Slicing algorithm for Multi-Core model checking, Proceedings of the 6th International Workshop on Parallel and Distributed Methods in veriCation, pp.3-16, 2007.

C. P. Inggs and H. Barringer, Eective state exploration for model checking on a shared memory architecture, Electronic Notes in Theoretical Computer Science Parallel and Distributed Model Checking, vol.68605, issue.620, 2002.

C. P. Inggs and H. Barringer, CTL* model checking on a sharedmemory architecture, Formal Methods in System Design, vol.29, issue.2, p.135155, 1936.

B. Jenkins, Algorithm alley: Hash functions. Dobb's Journal, p.169, 1997.

J. Gerard and H. , Design and validation of protocols: a tutorial, Protocol Specications, Testing and Verication, pp.981-1017, 1993.

C. Joubert and R. Mateescu, Distributed Local Resolution of Boolean Equation Systems, 13th Euromicro Conference on Parallel, Distributed and Network-Based Processing, pp.264271-264307, 2005.
DOI : 10.1109/EMPDP.2005.19
URL : https://hal.archives-ouvertes.fr/hal-00683892

C. Joubert and R. Mateescu, Distributed On-the-Fly Model Checking and Test Case Generation, Model Checking Software, p.126
DOI : 10.1007/BFb0054166
URL : https://hal.archives-ouvertes.fr/inria-00071388

E. G. Kumar and . Mercer, Load Balancing Parallel Explicit State Model Checking, Proceedings of the 3rd International Workshop on Parallel and Distributed Methods in Verication, pp.19-34, 2004.
DOI : 10.1016/j.entcs.2004.10.016

A. Kirsch and M. Mitzenmacher, Less hashing, same performance: Building a better bloom lter, BIBLIOGRAPHY Algorithms ESA 2006, p.456467, 1007.
DOI : 10.1002/rsa.20208
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.579

]. O. Kup95 and . Kupferman, Model Checking for Branching-Time Temporal Logics The Technion, p.36, 1995.

+. and ]. J. Lions, Ariane 5 ight 501 failure, Report by the Inquiry Board, vol.19, issue.1 2, p.182, 1996.

A. Lafuente, Simplied distributed LTL model checking by localizing cycles, p.31, 2002.

N. G. Leveson, Safeware: system safety and computers, p.182, 1995.

F. Lerda and R. Sisto, Distributed-Memory Model Checking with SPIN, Theoretical and Practical Aspects of SPIN Model Checking, pp.2239-2249, 1999.
DOI : 10.1007/3-540-48234-2_3

F. Lerda and W. Visser, Addressing dynamic issues of program model checking, Model Checking Software, p.80102, 2001.
DOI : 10.1007/3-540-45139-0_6

]. A. Bibliography-[-lvdpw10, J. Laarman, M. Van-de-pol, and . Weber, Boosting multi-core reachability performance with shared hash tables In Formal Methods in Computer- Aided Design, Moore et al. Cramming more components onto integrated circuits. Proceedings of the IEEE, pp.247-255, 1998.

A. Miner and G. Ciardo, Ecient reachability set generation and storage using decision diagrams Application and Theory of Petri Nets, Lecture Notes in Computer Science, vol.1639, issue.155, pp.691691-141, 1999.

[. Merlin and D. Farber, Recoverability of Communication Protocols--Implications of a Theoretical Study, IEEE Transactions on Communications, vol.24, issue.9, pp.1036-1043, 1976.
DOI : 10.1109/TCOM.1976.1093424

T. Murata, Petri nets: Properties, analysis and applications, Proceedings of the IEEE, vol.77, issue.4, pp.541-141, 1941.
DOI : 10.1109/5.24143

M. David, G. Nicol, and . Ciardo, Automated parallelization of discrete State-Space generation, Journal of Parallel and Distributed Computing, vol.47, issue.2, pp.153-167, 1997.

G. Peter and . Neumann, Illustrative risks to the public in the use of computer systems and related technology, SIGSOFT Softw. Eng. Notes, vol.17, issue.1, pp.2332-182, 1992.

S. Orzan, J. Van-de-pol, and M. V. Espada, A State Space Distribution Policy Based on Abstract Interpretation, Proceedings of the 3rd BIBLIOGRAPHY International Workshop on Parallel and Distributed Methods in Verication, pp.35-45, 2004.
DOI : 10.1016/j.entcs.2004.10.017

R. Pelanek, BEEM: Benchmarks for Explicit Model Checkers, Proceedings of the 14th international SPIN conference on Model checking software, pp.263267-141, 2007.
DOI : 10.1007/978-3-540-73370-6_17

D. Petcu, Parallel explicit state reachability analysis and state space construction, Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings., pp.1314-1339, 2003.
DOI : 10.1109/ISPDC.2003.1267665
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.4568

M. Jaco-van-de-pol and . Weber, A Multi-Core Solver for Parity Games, Proceedings of the 7th International Workshop on Parallel and Distributed Methods in veriCation, pp.19-34, 2008.
DOI : 10.1016/j.entcs.2008.11.011

J. Queille and J. Sifakis, Specication and verication of concurrent systems in CESAR, Proceedings of the 5th Colloquium on International Symposium on Programming, 1982.

C. Rodrigues, P. E. Barbosa, J. Cabral, J. C. De-figueiredo, and D. D. Guerrero, A Bag-of-Tasks Approach for State Space Exploration Using Computational Grids, Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06), pp.226-235, 1924.
DOI : 10.1109/SEFM.2006.1

J. H. Reif, Depth-first search is inherently sequential, Information Processing Letters, vol.20, issue.5, pp.229-234, 1985.
DOI : 10.1016/0020-0190(85)90024-9

J. Reinders, Intel threading building blocks. O'Reilly, p.172, 2007.

U. Stern and D. Dill, Improved probabilistic verication by hash compaction Correct Hardware Design and Verication Methods, Lecture Notes in Computer Science, vol.987, p.206224, 1995.

B. Stern and D. L. Dill, A new scheme for Memory-Ecient probabilistic verication, IFIP TC6/WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specication, Testing, and Verication, pp.333348-333386, 1996.

U. Stern and D. L. Dill, Parallelizing the murphi verier, Computer Aided Verication. 9th International Conference, p.256267

C. Stirling, Bisimulation, modal logic and model checking games, Logic Journal of IGPL, vol.7, issue.1, pp.103124-103160, 1999.
DOI : 10.1093/jigpal/7.1.103
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.1594

R. T. Saad, S. D. Zilio, and B. Berthomieu, A general Lock-Free algorithm for parallel state space construction. Parallel and Distributed Methods in Verication, Ninth International Workshop on, and High Performance Computational Systems Biology, Second International Workshop on, pp.816-859, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00473072

R. Tarjan, Depth-rst search and linear graph algorithms, 12th Annual Symposium on, pp.121-80, 1971.
DOI : 10.1109/swat.1971.10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

R. T. Saad, S. D. Zilio, and B. Berthomieu, Mixed Shared-Distributed Hash Tables Approaches for Parallel State Space Construction, 2011 10th International Symposium on Parallel and Distributed Computing, pp.8-171, 2011.
DOI : 10.1109/ISPDC.2011.12
URL : https://hal.archives-ouvertes.fr/hal-00523188

T. Wilke, Alternating tree automata, parity games, and modal m-Calculus, Bulletin of the Belgian Mathematical Society Simon Stevin, vol.8, issue.2, pp.359-395, 2001.

P. Wolper and D. Leroy, Reliable hashing without collision detection An automata-theoretic approach to automatic program verication, IEEE Symposium on Logic in Computer Science, pp.5970-6010, 1986.