A calculus of mobile agents

  • Cédric Fournet
  • Georges Gonthier
  • Jean-Jacques Levy
  • Luc Maranget
  • Didier Rémy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1119)


We introduce a calculus for mobile agents and give its chemical semantics, with a precise definition for migration, failure, and failure detection. Various examples written in our calculus illustrate how to express remote executions, dynamic loading of remote resources and protocols with mobile agents. We give the encoding of our distributed calculus into the join-calculus.


Mobile Agent Structural Rule Error Recovery Reaction Rule Remote Procedure Call 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Amadio and S. Prasad. Localities and failures. In 14th Foundations of Software Technology and Theoretical Computer Science Conference. Springer-Verlag, 1994. LNCS 880.Google Scholar
  2. 2.
    G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217–248, 1992.Google Scholar
  3. 3.
    K. A. Bharat and L. Cardelli. Migratory applications. Technical Report 138, DEC-SRC, February 1996.Google Scholar
  4. 4.
    G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. Formal Aspects of Computing, 6:165–200, 1994.Google Scholar
  5. 5.
    L. Cardelli. A language with distributed scope. Computing Systems, 8(1):27–59, Jan. 1995.Google Scholar
  6. 6.
    C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In 23rd ACM Symposium on Principles of Programming Languages, Jan. 1996.Google Scholar
  7. 7.
    A. Giacalone, P. Mishra, and S. Prasad. FACILE: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121–160, 1989.Google Scholar
  8. 8.
    K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 151:437–486, 1995Google Scholar
  9. 9.
    E. Jul. Object Mobility in a Distributed Object-Oriented System. PhD thesis, University of Washington, Computer Science Department, Dec. 1988.Google Scholar
  10. 10.
    L. Leth and B. Thomsen. Some facile chemistry. Technical Report ECRC-92-14, European Computer-Industry Research Centre, Munich, May 1992.Google Scholar
  11. 11.
    R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification. Springer Verlag, 1993.Google Scholar
  12. 12.
    B. C. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 1995. To appear. A summary was presented at LICS '93.Google Scholar
  13. 13.
    B. C. Pierce and D. N. Turner. Concurrent objects in a process calculus. In Theory and Practice of Parallel Programming, Sendai, Japan, Apr. 1995. LNCS 907.Google Scholar
  14. 14.
    D. Sangiorgi. Localities and non-interleaving semantics in calculi for mobile processes. Technical Report ECS-LFCS-94-282, University of Edinburgh, 94. to appear in TCS.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Cédric Fournet
    • 1
  • Georges Gonthier
    • 1
  • Jean-Jacques Levy
    • 1
  • Luc Maranget
    • 1
  • Didier Rémy
    • 1
  1. 1.INRIA RocquencourtLe Chesnay CedexFrance

Personalised recommendations