G. Baulch, D. Hemmendinger, and C. Traver, Analyzing and verifying locally clocked circuits with the concurrency workbench, Proceedings. Fifth Great Lakes Symposium on VLSI, pp.144-147, 1995.
DOI : 10.1109/GLSV.1995.516041

M. Bernardo and R. Gorrieri, A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time, Theoretical Computer Science, vol.202, issue.1-2, pp.1-54, 1998.
DOI : 10.1016/S0304-3975(97)00127-8

M. Bernardo and R. Gorrieri, Corrigendum to ???A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time???, Theoretical Computer Science, vol.254, issue.1-2, pp.691-694, 2001.
DOI : 10.1016/S0304-3975(00)00256-5

H. Bohnenkamp, P. R. Argenio, H. Hermanns, and J. Katoen, MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems, IEEE Transactions on Software Engineering, vol.32, issue.10, pp.812-830, 2006.
DOI : 10.1109/TSE.2006.104

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

R. Cleaveland, J. Parrow, and B. Steffen, The concurrency workbench, Proceedings of the 1st Workshop on Automatic Verification Methods for Finite State Systems, pp.24-37, 1989.
DOI : 10.1007/3-540-52148-8_3

R. Cleaveland, P. M. Lewis, S. A. Smolka, and O. Sokolsky, The Concurrency Factory: A development environment for concurrent systems, Proceedings of the 8th International Conference on Computer Aided Verification CAV'96, pp.398-401, 1996.
DOI : 10.1007/3-540-61474-5_88

R. Cleaveland, T. Li, and S. Sims, The Concurrency Workbench of the New Century (Version 1.2) User's manual, 2000.

D. Dams and J. F. Groote, Specification and Implementation of Components of a µCRL Toolbox, 1995.

J. W. Davies and S. A. Schneider, A brief history of Timed CSP, Theoretical Computer Science, vol.138, issue.2, pp.243-271, 1995.
DOI : 10.1016/0304-3975(94)00169-J

A. Davis and S. M. Nowick, An Introduction to Asynchronous Circuit Design. UUCS 97-013, 1997.

C. Fournet and G. Gonthier, The reflexive CHAM and the join-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, pp.372-385, 1996.
DOI : 10.1145/237721.237805

C. Fournet and L. Maranget, The Join-Calculus Language ? Release 1.05. Documentation and User's Manual, 2000.

H. Garavel, Compilation et vérification de programmes LOTOS, Thèse de Doctorat, 1989.

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 H. Hermanns, On Combining Functional Verification and Performance Evaluation Using CADP, Proceedings of the 11th International Symposium of Formal Methods Europe FME'2002, pp.410-429, 2002.
DOI : 10.1007/3-540-45614-7_23
URL : https://hal.archives-ouvertes.fr/inria-00072096

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
DOI : 10.1007/0-306-47003-9_24
URL : https://hal.archives-ouvertes.fr/inria-00072396

H. Garavel and F. Lang, NTIF: A General Symbolic Model for Communicating Sequential Processes with Data, Proceedings of the 22nd IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems FORTE'2002, pp.276-291, 2002.
DOI : 10.1007/3-540-36135-9_18
URL : https://hal.archives-ouvertes.fr/inria-00071919

H. Garavel, F. Lang, R. Mateescu, and W. Serwe, CADP??2006: A Toolbox for the Construction and Analysis of Distributed Processes, Proceedings of the 19th International Conference on Computer Aided Verification CAV'2007, pp.158-163, 2007.
DOI : 10.1007/978-3-540-73368-3_18
URL : https://hal.archives-ouvertes.fr/inria-00189021

H. Garavel, R. Mateescu, D. Bergamini, A. Curic, N. Descoubes et al., DISTRIBUTOR and BCG_MERGE: Tools for Distributed Explicit State Space Generation, Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems TACAS'2006, pp.445-449, 2006.
DOI : 10.1007/3-540-44612-5_34

H. Garavel and W. Serwe, State space reduction for process algebra specifications, Theoretical Computer Science, vol.351, issue.2, pp.131-145, 2006.
DOI : 10.1016/j.tcs.2005.09.064

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

J. F. Groote and A. Ponse, The Syntax and Semantics of µCRL, Algebra of Communicating Processes'94, Workshops in Computing Series, pp.26-62, 1995.

S. Hauck, Asynchronous design methodologies: an overview, Proceedings of the IEEE, vol.83, issue.1, pp.69-93, 1995.
DOI : 10.1109/5.362752

H. Hermanns, Interactive Markov Chains and the Quest for Quantified Quality, volume 2428 of Lecture Notes in Computer Science, 2002.

J. Hillston, Process Algebras for Quantitative Analysis, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.239-248, 2005.
DOI : 10.1109/LICS.2005.35

A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker, PRISM: A Tool for Automatic Verification of Probabilistic Systems, 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), pp.441-444
DOI : 10.1007/11691372_29

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

A. T. Hofkamp and J. E. Roodae, Chi 1.0 Reference Manual (Revision: 1322), 2007.

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, Enhancements to LOTOS (E-LOTOS) International Standard 15437, International Organization for Standardization ? Information Technology, 2001.

K. Iverson, Notation as a Tool of Thought, Communications of the ACM, vol.23, issue.8, 1980.

G. Karjoth, C. Binding, and J. Gustafsson, LOEWE: A LOTOS engineering workbench, Computer Networks and ISDN Systems, vol.25, issue.7, pp.853-874, 1993.
DOI : 10.1016/0169-7552(93)90052-6

J. Magee and J. Kramer, Concurrency: State Models and Java Programs, 2006.

A. J. Martin, Compiling communicating processes into delay-insensitive VLSI circuits, Distributed Computing, vol.20, issue.8, pp.226-234, 1986.
DOI : 10.1007/BF01660034
URL : http://authors.library.caltech.edu/26661/2/postscript.pdf

R. Mateescu, Local Model-Checking of an Alternation-Free Value-Based Modal Mu- Calculus, Proceedings of the 2nd International Workshop on Verification, Model Checking and Abstract Interpretation VMCAI'98, 1998.

R. Mateescu, Vérification des propriétés temporelles des programmesparalì eles, Thèse de Doctorat, 1998.

S. Mauw and G. J. Veltink, A Process Specification Formalism, pp.85-139, 1990.

G. J. Milne, CIRCAL and the representation of communication, concurrency, and time, ACM Transactions on Programming Languages and Systems, vol.7, issue.2, pp.270-298, 1985.
DOI : 10.1145/3318.3322

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes I. Information and Computation, pp.1-40, 1992.

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, II, Information and Computation, vol.100, issue.1, pp.41-77, 1992.
DOI : 10.1016/0890-5401(92)90009-5

R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol.92, 1980.
DOI : 10.1007/3-540-10235-3

R. Milner, Communication and Concurrency, 1989.

R. Milner, Bigraphs as a Model for Mobile Interaction, Proceedings of the First International Conference on Graph Transformation ICGT'02 number 2505 in Lecture Notes in Computer Science, pp.8-13, 2002.
DOI : 10.1007/3-540-45832-8_3

M. Renaudin, TAST Compiler and TAST-CHP Language ? Version 0.6. TIMA Laboratory, CIS Group, 2005.

G. Salaün, J. Kramer, F. Lang, and J. Magee, Translating FSP into LOTOS and Networks of Automata, Proceedings of the 6th International Conference on Integrated Formal Methods IFM Lecture Notes in Computer Science, 2007.
DOI : 10.1007/978-3-540-73210-5_29

G. Salaün and W. Serwe, Translating Hardware Process Algebras into Standard Process Algebras: Illustration with CHP and LOTOS, Proceedings of the 5th International Conference on Integrated Formal Methods IFM'2005, 2005.
DOI : 10.1007/11589976_17

G. Salaün, W. Serwe, Y. Thonnart, and P. Vivet, Formal Verification of CHP Specifications with CADP Illustration on an Asynchronous Network-on-Chip, 13th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'07), pp.73-82, 2007.
DOI : 10.1109/ASYNC.2007.18

D. Sangiorgi and D. Walker, The ?-calculus: a Theory of Mobile Processes, 2001.

M. Sighireanu, . Lotos, and . User, s Manual (Version 2.4) INRIA projet VASY, 2004.

J. Spars and S. B. Furber, Principles of Asynchronous Circuit Design: A Systems Perspective. European Low-Power Initiative for Electronic System Design, 2002.
DOI : 10.1007/978-1-4757-3385-3

P. Stevens, The Edinburgh Concurrency Workbench (Version 7.1) User manual, 1997.

X. Wang, M. Kwiatkowska, G. Theodoropoulos, and Q. Zhang, Opportunities and Challenges in Process-algebraic Verification of Asynchronous Circuit Designs, Proceedings of the Second Workshop on Globally Asynchronous Locally Synchronous Design (FM- GALS'05), pp.189-206, 2006.
DOI : 10.1016/j.entcs.2005.05.042

A. G. Wouters, Manual for the muCRL Tool Set (Version 2.8.2), 2001.

T. Yoneda, A. Shibayama, and T. Nanya, Verification of Asynchronous Logic Circuit Design using Process Algebra, Systems and Computers in Japan, vol.28, pp.8-933, 1997.

I. Centre-de-recherche and . Futurs, 4, rue Jacques Monod -Bât. G -91893 Orsay Cedex (France) Centre de recherche INRIA Nancy ? Grand Est : 615, rue du Jardin Botanique -54600 Villers-lès-Nancy (France) Centre de recherche INRIA Rennes ? Bretagne Atlantique : Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Centre de recherche INRIA Paris ? Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Centre de recherche, 2004.