A. Arnold and . Mec, MEC : a system for constructing and analysing transition systems, Proceedings of the 1st Workshop on Automatic Verification Methods for Finite State Systems, pp.117-132, 1989.
DOI : 10.1007/3-540-52148-8_11

A. Bouajjani, J. Fernandez, S. Graf, C. Rodríguez, and J. Sifakis, Safety for branching time semantics, Proceedings of 18th ICALP, 1991.
DOI : 10.1007/3-540-54233-7_126
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.1049

A. Bouali, A. Ressouche, V. Roy, R. , and S. , The Fc2Tools set: a Toolset for the Verification of Concurrent Systems, Proceedings of the 8th Conference on Computer-Aided Verification volume 1102 of Lecture Notes in Computer Science, 1996.

S. D. Brookes, C. A. Hoare, and A. W. Roscoe, A Theory of Communicating Sequential Processes, Journal of the ACM, vol.31, issue.3, pp.560-599, 1984.
DOI : 10.1145/828.833

G. Chehaibar, H. Garavel, L. Mounier, N. Tawbi, and F. Zulian, Specification and Verification of the PowerScale Bus Arbitration Protocol: An Industrial Experiment with LOTOS, Proceedings of the Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification FORTE/PSTV'96, pp.435-450, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073740

K. H. Cheung, Compositional Analysis of Complex Distributed Systems, 1998.

S. C. Cheung and J. Kramer, Enhancing Compositional Reachability Analysis with Context Constraints, Proceedings of the 1st ACM SIGSOFT International Symposium on the Foundations of Software Engineering, pp.115-125, 1993.
DOI : 10.1145/167049.167071
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.6843

S. C. Cheung and J. Kramer, Compositional Reachability Analysis of Finite-State Distributed Systems with User-Specified Constraints, Proceedings of the 3rd ACM SIG- SOFT International Symposium on the Foundations of Software Engineering, pp.140-150, 1995.

S. C. Cheung and J. Kramer, Context constraints for compositional reachability analysis, ACM Transactions on Software Engineering and Methodology, vol.5, issue.4, pp.334-377, 1996.
DOI : 10.1145/235321.235323

J. Fernandez, ALDEBARAN : un système de vérification par réduction de processus communicants, Thèse de Doctorat, 1988.

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 and F. Lang, SVL: A Scripting Language for Compositional Verification, Proceedings of the 21st IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems FORTE'2001, pp.377-392, 2001.
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 J. Sifakis, Compilation and Verification of LOTOS Specifications, Proceedings of the 10th International Symposium on Protocol Specification, Testing and Verification, pp.379-394, 1990.

H. Garavel and M. Sighireanu, A Graphical Parallel Composition Operator for Process Algebras, Proceedings of the Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing , and Verification FORTE/PSTV'99, pp.185-202, 1999.
DOI : 10.1007/978-0-387-35578-8_11

D. Giannakopoulou, Model Checking for Concurrent Software Architectures, 1999.

M. Goldsmith, Operational Semantics for Fun and Profit, Proceedings of the Symposium on the Occasion of 25 Years of Csp, 2005.
DOI : 10.1007/11423348_16

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. Friso-groote and M. Reniers, Algebraic Process Verification, Handbook of Process Algebra, pp.1151-1208, 2001.

J. F. Groote and A. Ponse, Syntax and semantics of µ-CRL, Proceedings of Algebra of Communicating Processes, Workshops in Computing, 1995.

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.

I. Iec, Open Distributed Processing ? Reference Model. International Standard 10746, International Organization for Standardization ? Information Processing Systems, 1995.

I. Iec, Enhancements to LOTOS (E-LOTOS) International Standard 15437, International Organization for Standardization ? Information Technology, 2001.

J. Krimm, Application des ordres partielsàpartiels`partielsà la génération compositionnelle de systèmes asynchrones, Thèse de Doctorat, 2000.

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.

F. Lang and . Exp, 0: A Flexible Tool Integrating Partial Order, Compositional , and On-the-fly Verification Methods The Netherlands), Lecture Notes in Computer Science, Proceedings of the 5th International Conference on Integrated Formal Methods IFM'2005, 2005.

J. Malhotra, S. A. Smolka, A. Giacalone, and R. Shapiro, Winston: A Tool for Hierarchical Design and Simulation of Concurrent Systems, Proceedings of the BCS-FACS Workshop on Specification and Verification of Concurrent Systems, pp.140-152, 1988.
DOI : 10.1007/978-1-4471-3534-0_7

R. Milner, Communication and Concurrency, 1989.

J. Romijn, Model Checking the HAVi Leader Election Protocol, 1999.

A. W. Roscoe, The Theory and Practice of Concurrency, 1998.

K. K. Sabnani, A. M. Lapone, and M. U. Uyar, An algorithmic procedure for checking safety properties of protocols, IEEE Transactions on Communications, vol.37, issue.9, pp.940-948, 1989.
DOI : 10.1109/26.35374

K. C. Tai and V. Koppol, Hierarchy-Based Incremental Reachability Analysis of Communication Protocols, Proceedings of the IEEE International Conference on Network Protocols, pp.318-325, 1993.

K. C. Tai and V. Koppol, An Incremental Approach to Reachability Analysis of Distributed Programs, Proceedings of the 7th International Workshop on Software Specification and Design, pp.141-150, 1993.

F. Tronel, F. Lang, and H. Garavel, Compositional Verification Using CADP of the ScalAgent Deployment Protocol for Software Components, Proceedings of the 6th IFIP International Conference on Formal Methods for Open Object-based Distributed Systems FMOODS'2003, pp.244-260
DOI : 10.1109/26.35374
URL : https://hal.archives-ouvertes.fr/inria-00071572

A. Valmari, Compositional state space generation, Proceedings of Advances in Petri Nets, pp.427-457, 1993.
DOI : 10.1007/3-540-56689-9_54

W. J. Yeh, Controlling State Explosion in Reachability Analysis, 1993.

W. J. Yeh and M. Young, Compositional reachability analysis using process algebra, Proceedings of the symposium on Testing, analysis, and verification , TAV4, pp.49-59, 1991.
DOI : 10.1145/120807.120812

I. Unité-de-recherche and I. Rhône, Alpes 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4

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