B. Aman, G. Ciobanu, K. Suzuki, T. Higashino, and K. Yasumoto, Timed Mobile Ambients for Network Protocols, Lecture Notes in Computer Science, vol.173, issue.1, pp.234-250, 2008.
DOI : 10.1007/3-540-45694-5_20

J. C. Baeten and J. A. Bergstra, Discrete time process algebra: Absolute time, relative time and parametric time, Fundam. Inform, vol.29, issue.12, pp.51-76, 1997.

M. Berger, Towards Abstractions for Distributed Systems, 2002.

B. Bloom, S. Istrail, and A. R. Meyer, Bisimulation can't be traced, pp.229-239, 1988.
DOI : 10.1145/200836.200876
URL : http://ecommons.cornell.edu/bitstream/1813/6990/1/90-1150.pdf

L. Cardelli and A. D. Gordon, Mobile ambients, FoSSaCS. Lecture Notes in Computer Science, vol.1378, pp.140-155, 1998.
DOI : 10.1007/BFb0053547

L. Chen, Timed Processes: Models, Axioms and Decidability, 1993.

G. Ciobanu, M. Wirsing, J. P. Banâtre, M. M. Hölzl, and A. Rauschmayer, Behaviour Equivalences in Timed Distributed ??-Calculus, Software-Intensive Systems and New Computing Paradigms, pp.190-208, 2008.
DOI : 10.1006/inco.2001.3089

G. Ciobanu and C. Juravle, Flexible software architecture and language for mobile agents, Concurrency and Computation: Practice and Experience, vol.32, issue.6, p.559571, 2012.
DOI : 10.1002/cpe.1854

G. Ciobanu and M. Koutny, Modelling and Verification of Timed Interaction and Migration, FASE. Lecture Notes in Computer Science, vol.4961, pp.215-229, 2008.
DOI : 10.1007/978-3-540-78743-3_16

G. Ciobanu and M. Koutny, Timed Migration and Interaction with Access Permissions, Lecture Notes in Computer Science, vol.29, pp.293-307, 2011.
DOI : 10.1145/262009.262010

G. Ciobanu and M. Koutny, Timed Mobility in process algebra and Petri nets, The Journal of Logic and Algebraic Programming, vol.80, issue.7, pp.377-391, 2011.
DOI : 10.1016/j.jlap.2011.05.002
URL : http://doi.org/10.1016/j.jlap.2011.05.002

G. Ciobanu and C. Prisacariu, Timers for Distributed Systems, Electronic Notes in Theoretical Computer Science, vol.164, issue.3, pp.81-99, 2006.
DOI : 10.1016/j.entcs.2006.07.013
URL : http://doi.org/10.1016/j.entcs.2006.07.013

C. Fournet and G. Gonthier, The Join Calculus: A Language for Distributed Mobile Programming, APPSEM. Lecture Notes in Computer Science, vol.2395, pp.268-332, 2000.
DOI : 10.1007/3-540-45699-6_6

J. F. Groote, Transition system specifications with negative premises, Theoretical Computer Science, vol.118, issue.2, pp.263-299, 1993.
DOI : 10.1016/0304-3975(93)90111-6
URL : http://doi.org/10.1016/0304-3975(93)90111-6

M. Hennessy, A distributed ?-calculus, 2007.
DOI : 10.1017/CBO9780511611063

M. Hennessy and T. Regan, A Process Algebra for Timed Systems, Information and Computation, vol.117, issue.2, pp.221-239, 1995.
DOI : 10.1006/inco.1995.1041
URL : http://doi.org/10.1006/inco.1995.1041

R. Milner, Communicating and mobile systems -the ?-calculus, 1999.

F. Moller, Axioms for Concurrency, 1989.

X. Nicollin and J. Sifakis, The Algebra of Timed Processes, ATP: Theory and Application, Information and Computation, vol.114, issue.1, pp.131-178, 1994.
DOI : 10.1006/inco.1994.1083

J. Parrow and B. Victor, The fusion calculus: expressiveness and symmetry in mobile processes, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226), pp.176-185, 1998.
DOI : 10.1109/LICS.1998.705654

E. Posse and J. Dingel, Theory and Implementation of a Real-Time Extension to the ??-Calculus, Lecture Notes in Computer Science, vol.6117, pp.125-139, 2010.
DOI : 10.1007/978-3-642-13464-7_11
URL : https://hal.archives-ouvertes.fr/hal-01055159

D. Sangiorgi, On the proof method for bisimulation, MFCS. Lecture Notes in Computer Science, vol.969, pp.479-488, 1995.
DOI : 10.1007/3-540-60246-1_153

D. Sangiorgi, A theory of bisimulation for the ??-calculus, Acta Informatica, vol.XVI, issue.2, pp.69-97, 1996.
DOI : 10.1007/s002360050036

D. Sangiorgi and D. Walker, The ?-Calculus -a theory of mobile processes, 2001.

W. Yi, A Calculus of Real-Time Systems, 1991.