Abstract
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.
This work is partly supported by the ESPRIT Basic Research Action 6454 — CON-FER.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Amadio and S. Prasad. Localities and failures. In 14th Foundations of Software Technology and Theoretical Computer Science Conference. Springer-Verlag, 1994. LNCS 880.
G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217–248, 1992.
K. A. Bharat and L. Cardelli. Migratory applications. Technical Report 138, DEC-SRC, February 1996.
G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. Formal Aspects of Computing, 6:165–200, 1994.
L. Cardelli. A language with distributed scope. Computing Systems, 8(1):27–59, Jan. 1995.
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.
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.
K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 151:437–486, 1995
E. Jul. Object Mobility in a Distributed Object-Oriented System. PhD thesis, University of Washington, Computer Science Department, Dec. 1988.
L. Leth and B. Thomsen. Some facile chemistry. Technical Report ECRC-92-14, European Computer-Industry Research Centre, Munich, May 1992.
R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification. Springer Verlag, 1993.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fournet, C., Gonthier, G., Levy, JJ., Maranget, L., Rémy, D. (1996). A calculus of mobile agents. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_67
Download citation
DOI: https://doi.org/10.1007/3-540-61604-7_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61604-7
Online ISBN: 978-3-540-70625-0
eBook Packages: Springer Book Archive