A. Arnold, Finite transition systems. Semantics of communicating sytems, 1994.

T. Barros, R. Boulifa, A. Cansado, L. Henrio, and E. Madelaine, Behavioural models for distributed Fractal components, annals of telecommunications - annales des t??l??communications, vol.5, issue.1, 2008.
DOI : 10.1007/s12243-008-0069-7
URL : https://hal.archives-ouvertes.fr/inria-00268965

T. Barros, L. Henrio, and E. Madelaine, Verification of Distributed Hierarchical Components, International Workshop on Formal Aspects of Component Software (FACS'05), 2005.
DOI : 10.1016/j.entcs.2006.05.014
URL : https://hal.archives-ouvertes.fr/inria-00122926

F. Baude, D. Caromel, C. Dalmasso, M. Danelutto, V. Getov et al., GCM: a grid extension to Fractal for autonomous distributed components, annals of telecommunications - annales des t??l??communications, vol.36, issue.1, 2008.
DOI : 10.1007/s12243-008-0068-8
URL : https://hal.archives-ouvertes.fr/inria-00323919

D. Caromel, C. Delbé, A. Di-costanzo, and M. Leyton, ProActive: an integrated platform for programming and running applications on Grids and P2P systems, Computational Methods in Science and Technology, vol.12, issue.1, pp.69-77, 2006.
DOI : 10.12921/cmst.2006.12.01.69-77
URL : https://hal.archives-ouvertes.fr/hal-00125034

D. Caromel and L. Henrio, A Theory of Distributed Object, 2005.

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/inria-00528590

F. De-boer, D. Clarke, and E. B. Johnsen, A Complete Guide to the Future, ESOP, pp.316-330, 2007.
DOI : 10.1007/978-3-540-71316-6_22

J. Dedecker, T. V. Cutsem, S. Mostinckx, T. D. Hondt, and W. D. Meuter, Ambient-Oriented Programming in AmbientTalk, Lecture Notes in Computer Science, vol.4067, pp.230-254, 2006.
DOI : 10.1007/11785477_16

F. Fernandes and J. Royer, The STSLib Project: Towards a Formal Component Model Based on STS, Proceedings of the Fourth International Workshop on Formal Aspects of Component Software (FACS'07), 2007.
DOI : 10.1016/j.entcs.2008.06.025
URL : https://hal.archives-ouvertes.fr/hal-00416461

C. Flanagan and M. Felleisen, The semantics of future and an application, Journal of Functional Programming, vol.9, issue.1, pp.1-31, 1999.
DOI : 10.1017/S0956796899003329

H. Garavel, F. Lang, and R. Mateescu, An overview of CADP 2001. European Association for Software Science and Technology Newsletter, pp.13-24, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00069920

R. H. Halstead and J. , MULTILISP: a language for concurrent symbolic computation, ACM Transactions on Programming Languages and Systems, vol.7, issue.4, pp.501-538, 1985.
DOI : 10.1145/4472.4478

R. Mateescu, Efficient Diagnostic Generation for Boolean Equation Systems, Tools and Algorithms for Construction and Analysis of Systems, pp.251-265, 2000.
DOI : 10.1007/3-540-46419-0_18
URL : https://hal.archives-ouvertes.fr/inria-00072795

J. Niehren, J. Schwinghammer, and G. Smolka, A concurrent lambda calculus with futures, Theoretical Computer Science, vol.364, issue.3, pp.338-356, 2006.
DOI : 10.1016/j.tcs.2006.08.016
URL : https://hal.archives-ouvertes.fr/inria-00090434

J. Queille and J. Sifakis, Fairness and related properties in transition systems ? a temporal logic to deal with fairness, Acta Informatica, vol.19, issue.3, pp.195-220, 1983.
DOI : 10.1007/BF00265555

A. Yonezawa, E. Shibayama, T. Takada, and Y. Honda, Modelling and programming in an objectoriented concurrent language ABCL/1, Object-Oriented Concurrent Programming, pp.55-89, 1987.