H. R. Andersen, Model checking and boolean graphs, Theoretical Computer Science, vol.126, issue.1, pp.3-30, 1994.
DOI : 10.1016/0304-3975(94)90266-6

S. C. Blom, Partial ? -Confluence for Efficient State Space Generation, Centrum voor Wiskunde en Informatica, 2001.

S. Blom and J. Van, State Space Reduction by Proving Confluence, Computer Aided Verification, 2002.
DOI : 10.1007/3-540-45657-0_50

J. Fernandez, H. Garavel, L. Mounier, A. Rasse, C. Rodríguez et al., A Toolbox for the Verification of LOTOS Programs, Proceedings of the 14th International Conference on Software Engineering ICSE'14, pp.246-259, 1992.

H. Garavel, . Open, and . Caesar, OPEN/C??SAR: An open software architecture for verification, simulation, and testing, Proceedings of the First International Conference on Tools and Algorithms for the Construction and Analysis of Systems TACAS'98, pp.68-84, 1998.
DOI : 10.1007/BFb0054165

H. Garavel and F. Lang, SVL: A Scripting Language for Compositional Verification, Proceedings of the 21st IFIP WG 6.1 International Conference on Formal
DOI : 10.1007/0-306-47003-9_24

URL : https://hal.archives-ouvertes.fr/inria-00072396

H. Garavel, F. Lang, and R. Mateescu, An Overview of CADP European Association for Software Science and Technology (EASST) Newsletter, pp.13-24, 2001.

H. Garavel and L. Mounier, Specification and verification of various distributed leader election algorithms for unidirectional ring networks, Science of Computer Programming, vol.29, issue.1-2, pp.171-197, 1997.
DOI : 10.1016/S0167-6423(96)00034-2

S. Graf, B. Steffen, and G. Lüttgen, Compositional minimisation of finite state systems using interface specifications, Formal Aspects of Computing, vol.17, issue.5, pp.607-616, 1996.
DOI : 10.1007/BF01211911

S. Graf and B. Steffen, Compositional minimization of finite state systems, Proceedings of the 2nd Workshop on Computer-Aided Verification, pp.186-196, 1990.
DOI : 10.1007/BFb0023732

J. F. Groote and J. Van, State Space Reduction Using Partial ??-Confluence, Mogens Nielsen and Branislav Rovan Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science MFCS'2000, pp.383-393, 2000.
DOI : 10.1007/3-540-44612-5_34

J. F. Groote and M. P. Sellink, Confluence for process verification, Theoretical Computer Science, vol.170, issue.1-2, pp.47-81, 1996.
DOI : 10.1016/S0304-3975(96)80702-X

I. Iec, LOTOS ? A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour, International Organization for Standardization ? Information Processing Systems ? Open Systems Interconnection, 1989.

J. Krimm and L. Mounier, Compositional State Space Generation from LOTOS Programs Tools and Algorithms for the Construction and Analysis of Systems, Proceedings of TACAS'97, 1997.

R. Mateescu, A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems, Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems TACAS'2003, pp.81-96, 2003.
DOI : 10.1007/3-540-36577-X_7

URL : https://hal.archives-ouvertes.fr/inria-00071875

R. Nalumasu and G. Gopalakrishnan, An Efficient Partial Order Reduction Algorithm with an Alternative Proviso Implementation. Formal Methods in System Design, 2002.

Y. S. Ramakrishna and S. A. Smolka, Partial-order reduction in the weak modal mu-calculus, Proceedings of the 8th International Conference on Concurrency Theory CONCUR'97, pp.5-24, 1997.
DOI : 10.1007/3-540-63141-0_2

A. W. Roscoe, P. H. Gardiner, M. H. Goldsmith, J. R. Hulance, D. M. Jackson et al., Hierarchical compression for modelchecking CSP or how to check 10 20 dining philosophers for deadlock, Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 1995.

A. Valmari, Stubborn Set Methods for Process Algebras In Workshop on Partial Order Methods in Verification, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.29, 1997.

R. J. Van-glabbeek and W. Peter-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

M. Ying, Weak confluence and ??-inertness, Theoretical Computer Science, vol.238, issue.1-2, pp.465-475, 2000.
DOI : 10.1016/S0304-3975(99)00084-5

URL : http://doi.org/10.1016/s0304-3975(99)00084-5

I. Unité-de-recherche and . Lorraine, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-l` es-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche, 2004.

I. Editeur and . De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399