Abstract
Purchase PDF (243 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (5)
Purchase PDF (6204 K)
doi:10.1016/S0304-3975(00)00093-1 
Copyright © 2001 Elsevier Science B.V. All rights reserved.
Names of the π-calculus agents handled locally*1
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Chiara Bodei
, 
, a, Pierpaolo Degano, a and Corrado Priami, b
Available online 4 December 2000.
Abstract
We address the problem of handling names in concurrent and distributed systems made up of mobile processes. We equip processes with local environments. Our structural operational semantics handles these environments so that captures of names are never possible. Our semantics includes the specification of a distributed name manager that conservatively extends standard operational semantics. Bisimulation-based equivalences can be checked on our transition systems. They yield the same equivalence relations as those based on standard interleaving semantics. Finally, we show that our development scales up smoothly to higher-order calculi.
Author Keywords: Concurrency; Mobility; Agents; Distributed environments
*1 Work partially supported by ESPRIT BRA no. 8130 – LOMAPS. The first two authors have been also partially supported by the CNR Progetto Strategico Modelli e Metodi per la Matematica e l’Ingegneria and by the MURST Progetto Tecniche Formali per la Specifica, l’Analisi, la Verifica, la Sintesi e la Trasformazione di Sistemi Software. Portions of Sections 1 and 3–5 appeared in: F. Meyer auf der Heide, B. Monien (Eds.), Proc. 23rd ICALP, Paderborn, Germany, Lecture Notes in Computer Science, vol. 1099. Springer, Berlin, July 1996, pp. 490–501.
Corresponding author; email: chiara@di.unipi.it
