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

S. D. Brookes, C. A. Hoare, and A. W. Roscoe, A Theory of Communicating Sequential Processes, Theory of Communicating Sequential Processes, pp.560-599, 1984.
DOI : 10.1145/828.833

A. W. Roscoe, Understanding Concurrent Systems, Texts in Computer Science, 2010.
DOI : 10.1007/978-1-84882-258-0

D. Austry and G. Boudol, Alg??bre de processus et synchronisation, Theoretical Computer Science, vol.30, issue.1, pp.91-131, 1984.
DOI : 10.1016/0304-3975(84)90067-7

J. A. Bergstra and J. W. Klop, Algebra of communicating processes with abstraction, Algebra of Communicating Processes with Abstraction, pp.77-121, 1985.
DOI : 10.1016/0304-3975(85)90088-X

J. Baeten and W. Weijland, of Cambridge Tracts in Theoretical Computer Science, Process Algebra, 1990.

W. Fokkink, Introduction to Process Algebra, Texts in Theoretical Computer Science, 2000.

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

T. Bolognesi and E. Brinksma, Introduction to the ISO specification language LOTOS, Computer Networks and ISDN Systems, vol.14, issue.1, pp.25-59, 1988.
DOI : 10.1016/0169-7552(87)90085-7

S. Mauw and G. J. Veltink, An introduction to PSFd, Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT'89), pp.272-285, 1989.
DOI : 10.1007/3-540-50940-2_41

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

J. Groote and A. Ponse, The Syntax and Semantics of µCRL, CS-R 9076, Centrum voor Wiskunde en Informatica, 1990.

J. Groote and A. Ponse, The Syntax and Semantics of µCRL, Proceedings of the 1st Workshop on the Algebra of Communicating Processes (ACP'94) Computing Series, pp.26-62, 1995.

J. Groote and M. Mousavi, Modeling and Analysis of Communicating Systems, 2014.

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, T. Li, and S. Sims, The Concurrency Workbench of the New Century (Version 1.2) ? User's Manual, 2000.

T. Gibson-robinson, P. J. Armstrong, A. Boulgakov, and A. W. Roscoe, FDR3 ??? A Modern Refinement Checker for CSP, Proceedings of the 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'14)
DOI : 10.1007/978-3-642-54862-8_13

J. Sun, Y. Liu, and J. S. Dong, Model Checking CSP Revisited: Introducing a Process Analysis Toolkit, Proceedings of the 3rd International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (ISoLA'08) of Communications in Computer and Information Science, pp.307-322, 2008.
DOI : 10.1109/TSE.2006.55

L. Shi, Y. Liu, J. Sun, J. S. Dong, and G. Carvalho, An Analytical and Experimental Comparison of CSP Extensions and Tools, Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM'12), pp.381-397, 2012.
DOI : 10.1007/978-3-642-34281-3_27

H. Garavel, F. Lang, R. Mateescu, and W. Serwe, CADP 2011: a toolbox for the construction and analysis of distributed processes, International Journal on Software Tools for Technology Transfer, vol.1, issue.1/2, pp.89-107, 2013.
DOI : 10.1007/s10009-012-0244-z
URL : https://hal.archives-ouvertes.fr/hal-00715056

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

S. Cranen, J. Groote, J. Keiren, F. Stappers, E. De-vink et al., An Overview of the mCRL2 Toolset and Its Recent Advances, Proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'13), pp.199-213, 2013.
DOI : 10.1007/978-3-642-36742-7_15

O. Sokolsky, Efficient Graph-based Algorithms for Model Checking in the Modal Mu-calculus, 1996.

B. Berthomieu, J. Bodeveix, P. Farail, M. Filali, H. Garavel et al., FIACRE: An Intermediate Language for Model Verification in the TOPCASED Environment, Proceedings of the 4th European Congress on Embedded Real-Time Software (ERTS'08), 2008.
URL : https://hal.archives-ouvertes.fr/inria-00262442

H. Garavel, Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular, Proceedings of the LIX Colloquium on Emerging Trends in Concurrency Theory, pp.149-164, 2006.
DOI : 10.1016/j.entcs.2008.04.009
URL : https://hal.archives-ouvertes.fr/inria-00191141

R. Milner, A complete inference system for a class of regular behaviours, Journal of Computer and System Sciences, vol.28, issue.3, pp.439-466, 1984.
DOI : 10.1016/0022-0000(84)90023-0

W. Janssen, M. Poel, and J. Zwiers, Action systems and action refinement in the development of parallel systems, Proceedings of the 2nd International Conference on Concurrency Theory (CONCUR'91), pp.298-316, 1991.
DOI : 10.1007/3-540-54430-5_96

L. Aceto and M. Hennessy, Towards Action-Refinement in Process Algebras, Information and Computation, vol.103, issue.2, pp.204-269, 1993.
DOI : 10.1006/inco.1993.1019

L. Aceto and M. Hennessy, Adding Action Refinement to a Finite Process Algebra, Information and Computation, vol.115, issue.2, pp.179-247, 1994.
DOI : 10.1006/inco.1994.1096

U. Goltz, R. Gorrieri, and A. Rensink, Comparing Syntactic and Semantic Action Refinement, Information and Computation, vol.125, issue.2, pp.118-143, 1996.
DOI : 10.1006/inco.1996.0026

T. Gehrke and A. Rensink, Process Creation and Full Sequential Composition in a Name-Passing Calculus, Proceedings of the 4th Workshop on Expressiveness in Concurrency (EXPRESS'97), pp.141-160, 1997.
DOI : 10.1016/S1571-0661(05)80471-2

R. Gorrieri and A. Rensink, Action Refinement, Handbook of Process Algebra, pp.1047-1147, 2001.
DOI : 10.1016/B978-044482830-9/50034-5

E. Brinksma, On the Design of Extended LOTOS ? A Specification Language for Open Distributed Systems, 1988.

C. Koymans and J. Vrancken, Extending Process Algebra with the Empty Process, Logic Group Preprint Series, CIF Nr, 1985.

J. Vrancken, The algebra of communicating processes with empty process, Theoretical Computer Science, vol.177, issue.2, pp.287-328, 1997.
DOI : 10.1016/S0304-3975(96)00250-2

J. A. Bergstra and J. W. Klop, The algebra of recursively defined processes and the algebra of regular processes, Proceedings of the 11th Colloquium on Automata, Languages and Programming (ICALP'84), pp.82-94, 1984.
DOI : 10.1007/3-540-13345-3_7

J. C. Baeten and J. A. Bergstra, On sequential composition, action prefixes and process prefix, Formal Aspects of Computing, vol.100, issue.3, pp.250-268, 1994.
DOI : 10.1007/BF01215407

H. Garavel, On the introduction of gate typing in E-LOTOS, Proceedings of the 15th IFIP International Workshop on Protocol Specification, Testing and Verification (PSTV'95), pp.283-298, 1995.
DOI : 10.1007/978-0-387-34892-6_18

J. C. Baeten and R. J. Van-glabbeek, Merge and termination in process algebra, Proceedings of the 7th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'87), pp.153-172, 1987.
DOI : 10.1007/3-540-18625-5_49

J. F. Groote and F. W. Vaandrager, Structured operational semantics and bisimulation as a congruence, Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP'89), pp.423-438, 1989.
DOI : 10.1007/BFb0035774

B. Bloom, W. Fokkink, and R. J. Van-glabbeek, Precongruence formats for decorated trace preorders, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.107-118, 2000.
DOI : 10.1109/LICS.2000.855760

P. R. D-'argenio and C. Verhoef, A general conservative extension theorem in process algebras with inequalities, Theoretical Computer Science, vol.177, issue.2, pp.351-380, 1997.
DOI : 10.1016/S0304-3975(96)00292-7

J. F. Groote and A. Ponse, Process algebra with guards, Proceedings of the 2nd International Conference on Concurrency Theory (CONCUR'91), pp.235-249, 1991.
DOI : 10.1007/3-540-54430-5_92

J. F. Groote and A. Ponse, Process algebra with guards: Combining Hoare logic with process algebra, Formal Aspects of Computing, vol.58, issue.3, pp.115-164, 1994.
DOI : 10.1007/BF01221097

A. Ponse, Process Algebra and Dynamic Logic, Logic and Information Flow, pp.125-148, 1994.

J. C. Baeten and V. Bos, Formalizing Programming Variables in Process Algebra, TUCS Technical Report Turku Centre for Computer Science, vol.493, 2002.

M. Weichert, Algebra of Broadcasting Systems: Value Passing, Sequential Composition, and Fork, Proceedings of the 6th Nordic Workshop on Programming Theory BRICS Note Series NS-94-6, pp.428-443, 1994.

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

H. Garavel and M. Sighireanu, French-Romanian Integrated Proposal for the User Language of E-LOTOS, Rapport SPECTRE 96-05, VERIMAG, Grenoble, Input Document, pp.12-21, 1996.

H. Garavel and M. Sighireanu, Towards a Second Generation of Formal Description Techniques ? Rationale for the Design of E-LOTOS

H. Garavel, F. Lang, and R. Mateescu, Compiler Construction Using LOTOS NT, Proceedings of the 11th International Conference on Compiler Construction (CC'02), pp.9-13, 2002.
DOI : 10.1007/3-540-45937-5_3

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

C. A. Hoare, The transputer and occam: A personal story, Concurrency: Practice and Experience, vol.31, issue.4, pp.249-264, 1991.
DOI : 10.1002/cpe.4330030403

G. Jones and M. Goldsmith, Programming in occam2 out of print, 1988.

A. W. Roscoe, Denotational semantics for occam, Proceedings of the Seminar on Concurrency, pp.306-329, 1984.
DOI : 10.1007/3-540-15670-4_15

A. W. Roscoe and C. Hoare, The laws of OCCAM programming, Theoretical Computer Science, vol.60, issue.2, pp.177-229, 1988.
DOI : 10.1016/0304-3975(88)90049-7

Y. Gurevich and L. S. Moss, Algebraic operational semantics and Occam, Proceedings of the 3rd Workshop on Computer Science Logic (CSL'89), pp.176-192, 1989.
DOI : 10.1007/3-540-52753-2_39

J. Camilleri, An operational semantics for occam, International Journal of Parallel Programming, vol.18, issue.5, pp.365-400, 1989.
DOI : 10.1007/BF01379186

G. Barrett, The semantics of priority and fairness in occam, Proceedings of 5th International Conference on the Mathematical Foundations of Programming Semantics (MFPS'89), pp.194-208, 1989.
DOI : 10.1007/BFb0040258

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

H. Garavel, G. Salaün, and W. Serwe, On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP, Science of Computer Programming, vol.74, issue.3, pp.100-127, 2009.
DOI : 10.1016/j.scico.2008.09.011
URL : https://hal.archives-ouvertes.fr/inria-00381642

P. R. D-'argenio, H. Hermanns, J. Katoen, and R. Klaren, MoDeST ? A Modelling and Description Language for Stochastic Timed Systems, Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM- PROBMIV'01), pp.87-104, 2001.

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

E. Hahn, A. Hartmanns, H. Hermanns, and J. Katoen, A compositional modelling and analysis framework for stochastic hybrid systems, Formal Methods in System Design, vol.2, issue.2, pp.191-232, 2013.
DOI : 10.1007/s10703-012-0167-z

V. Bos and J. J. Kleijn, Redesign of a Systems Engineering Language: Formalisation of ?, Formal Aspects of Computing, vol.15, issue.4, pp.370-389, 2003.
DOI : 10.1007/s00165-003-0017-2

R. R. Schiffelers, D. A. Van-beek, K. L. Man, M. A. Reniers, and J. E. Rooda, Formal Semantics of Hybrid Chi, Proceedings of the 1st International Workshop on Formal Modeling and Analysis of Timed Systems (FORMATS'03), pp.151-165, 2003.
DOI : 10.1007/978-3-540-40903-8_12

D. A. Van-beek, K. L. Man, M. A. Reniers, J. E. Rooda, and R. R. Schiffelers, Syntax and consistent equation semantics of hybrid Chi, Syntax and Consistent Equation Semantics of Hybrid Chi, pp.129-210, 2006.
DOI : 10.1016/j.jlap.2005.10.005

A. Fehnker, R. Glabbeek, P. Höfner, A. Mciver, M. Portmann et al., A Process Algebra for Wireless Mesh Networks, Proceedings of the 21st European Symposium on Programming (ESOP'12), pp.2012-295
DOI : 10.1007/978-3-642-28869-2_15

J. Parrow and B. Victor, The update calculus, Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology (AMAST'97, pp.409-423, 1997.
DOI : 10.1007/BFb0000486

D. T. Ross, Uniform Referents: An Essential Property for a Software Engineering Language, Software Engineering, pp.91-101, 1970.
DOI : 10.1016/B978-0-12-395495-4.50015-5

V. Bos and J. J. Kleijn, Formal Specification and Analysis of Industrial Systems, 2002.

H. Garavel and M. Sighireanu, On the Introduction of Exceptions in LO- TOS, Proceedings of the IFIP Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification , Testing, and Verification (FORTE/PSTV'96), pp.469-484, 1996.

R. E. Strom and S. Yemini, Typestate: A programming language concept for enhancing software reliability, IEEE Transactions on Software Engineering, vol.12, issue.1, pp.157-171, 1986.
DOI : 10.1109/TSE.1986.6312929

H. Garavel and J. Sifakis, Compilation and Verification of LOTOS Specifications, Proceedings of the 10th IFIP International Symposium on Protocol Specification, Testing and Verification (PSTV'90), pp.379-394, 1990.

J. F. Groote, A. Ponse, and Y. S. Usenko, Linearization in parallel pCRL, The Journal of Logic and Algebraic Programming, vol.48, issue.1-2, pp.1-2, 2001.
DOI : 10.1016/S1567-8326(01)00005-4

B. Berthomieu and T. L. Sergent, Programming with behaviors in an ML framework ??? The syntax and semantics of LCS, Proceedings of the 5th European Symposium on Programming Languages and Systems (ESOP'94), pp.89-104, 1994.
DOI : 10.1007/3-540-57880-3_6

A. W. Roscoe, C. Hoare, and R. Bird, The Theory and Practice of Concurrency, 1997.

H. Garavel and M. Sighireanu, A Graphical Parallel Composition Operator for Process Algebras, Proceedings of the IFIP 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

G. Plotkin, A Structural Approach to Operational Semantics, 1981.

G. D. Plotkin, A Structural Approach to Operational Semantics, Journal of Logic and Algebraic Programming, vol.60, pp.61-78, 2004.

G. Plotkin, An operational semantics for CSP, Proceedings of the 1980 Conference on Logics of Programs and Their Applications, pp.250-252, 1983.
DOI : 10.1007/3-540-11981-7_17

G. D. Plotkin, The Origins of Structural Operational Semantics, Journal of Logic and Algebraic Programming, vol.60, pp.61-64, 2004.

B. Bloom and F. Vaandrager, SOS Rule Formats for Parameterized and State- Bearing Processes, Unpublished manuscript available from http, 1994.

M. Mousavi, M. A. Reniers, and J. Groote, Notions of bisimulation and congruence formats for SOS with data, Information and Computation, vol.200, issue.1, pp.107-147, 2005.
DOI : 10.1016/j.ic.2005.03.002

D. Gebler, E. Goriac, and M. Mousavi, Algebraic Meta-Theory of Processes with Data, Proceedings of the Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics (EX- PRESS/SOS'13), Buenos Aires, Argentina of Electronic Proceedings in Theoretical Computer Science, pp.63-77, 2013.
DOI : 10.4204/EPTCS.120.6

R. De-nicola and A. Labella, A completeness theorem for nondeterministic Kleene algebras, Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science (MFCS'94), pp.536-545, 1994.
DOI : 10.1007/3-540-58338-6_100

F. Corradini, R. De-nicola, and A. Labella, Fully abstract models for nondeterministic regular expressions, Proceedings of the 6th International Conference on Concurrency Theory (CON- CUR'95), pp.130-144, 1995.
DOI : 10.1007/3-540-60218-6_10

F. Corradini, R. De-nicola, and A. Labella, Models of Nondeterministic Regular Expressions, Journal of Computer and System Sciences, vol.59, issue.3, pp.412-449, 1999.
DOI : 10.1006/jcss.1999.1636

J. C. Baeten and F. Corradini, Regular Expressions in Process Algebra, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.12-19, 2005.
DOI : 10.1109/LICS.2005.43

J. C. Baeten, F. Corradini, and C. Grabmayer, A characterization of regular expressions under bisimulation, Journal of the ACM, vol.54, issue.2
DOI : 10.1145/1219092.1219094

E. W. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Communications of the ACM, vol.18, issue.8, pp.453-457, 1975.
DOI : 10.1145/360933.360975

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, pp.276-291, 2002.
DOI : 10.1007/3-540-36135-9_18
URL : https://hal.archives-ouvertes.fr/inria-00071919

E. Lantreibecq and W. Serwe, Model Checking and Co-simulation of a Dynamic Task Dispatcher Circuit Using CADP, Proceedings of the 16th International Workshop on Formal Methods for Industrial Critical Systems (FMICS'11), pp.180-195, 2011.
DOI : 10.1007/978-3-642-24431-5_14
URL : https://hal.archives-ouvertes.fr/hal-00642029

M. Hennessy, A proof system for communicating processes with value-passing (extended abstract), Proof System for Communicating Processes with Valuepassing Proceedings of the 9th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS'89), pp.325-339, 1989.
DOI : 10.1007/3-540-52048-1_54

M. Hennessy, A proof system for communicating processes with value-passing, Formal Aspects of Computing, vol.21, issue.8, pp.346-366, 1991.
DOI : 10.1007/BF01642508

M. Hennessy and A. Ingólfsdóttir, A theory of communicating processes with value-passing, Proceedings of the 17th International Colloquium on Automata, Languages and Programming (ICALP'90), pp.209-219, 1990.
DOI : 10.1007/BFb0032033

M. Hennessy and A. Ingólfsdóttir, A Theory of Communicating Processes with Value Passing, Information and Computation, vol.107, issue.2, pp.202-236, 1993.
DOI : 10.1006/inco.1993.1067

M. Hennessy and H. Lin, Proof systems for message-passing process algebras, Formal Aspects of Computing, vol.1, issue.1, pp.379-407, 1996.
DOI : 10.1007/BF01213531