Abstract
In this paper we study an asynchronous distributed π-calculus, with constructs for localities and migration. We show that a simple static analysis ensures the receptiveness of channel names, which, together with a simple type system, guarantees that any migrating message will find an appropriate receiver at its destination locality. We argue that this receptive calculus is still expressive enough, by showing that it contains the π1-calculus, up to weak asynchronous bisimulation.
Work partially supported by the RNRT project MARVEL.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Amadio, I. Castellani and D. Sangiorgi, On bisimulations for the asynchronous calculus, CONCUR’96, Springer Lect. Notes in Comp. Sci. 1119 (1996) 147–162. 313
R. Amadio, An asynchronous model of locality, failure, and process mobility, In Proc. COORDINATION’97, Springer Lect. Notes in Comp. Sci. 1282 (1997). Extended version appeared as Res. Report INRIA 3109. 304, 305, 305, 306, 308, 308, 311, 313, 313, 313, 314
R. Amadio, On modeling mobility, Journal of Theoretical Computer Science, to appear (1999). 305, 305, 313, 313
G. Boudol, Typing the use of resources in a concurrent calculus, Proc. ASIAN 97, Springer Lect. Notes in Comp. Sci. 1345 (1997) 239–253. 305
L. Cardelli and A. Gordon, Mobile ambients, In Proc. FoSSaCS, ETAPS’98, Springer Lect. Notes in Comp. Sci. 1378 (1998) 140–155. 308, 308
C. Fournet and G. Gonthier, The reflexive CHAM and the join-calculus, In Proc. ACM Principles of Prog. Lang. (1996) 372–385. 304, 313, 313, 313
C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, and D. Rémy, A calculus of mobile agents, In Proc. CONCUR’96, Springer Lect. Notes in Comp. Sci. 1119 (1996) 406–421. 304, 308, 308
M. Hennessy and J. Riely, Resource access control in systems of mobile agents, Techn. Report 2/98, School of Cognitive and Computer Sciences, University of Sussex (1998). 304, 305, 305, 305, 306, 306, 306, 308, 308, 308, 310
N. Kobayashi, A partially deadlock-free typed process calculus, ACM TOPLAS Vol. 20 No 2 (1998) 436–482. 305
D. Sangiorgi, The name discipline of uniform receptiveness, In Proc. ICALP’97, Springer Lect. Notes in Comp. Sci. 1256 (1997) 303–313. 304, 304
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amadio, R.M., Boudol, G., Lhoussaine, C. (1999). The Receptive Distributed π-Calculus. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1999. Lecture Notes in Computer Science, vol 1738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46691-6_24
Download citation
DOI: https://doi.org/10.1007/3-540-46691-6_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66836-7
Online ISBN: 978-3-540-46691-8
eBook Packages: Springer Book Archive