MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  calculus, internal mobility and agent-passing calculi (1996) [63 citations — 6 self]

Download:
pdf | ps
by Davide Sangiorgi
Theoretical Computer Science
ftp://ftp-sop.inria.fr/meije/theorie-par/davides/piI.ps.Z
Add To MetaCart

Abstract:

The-calculus is a process algebra which originates from CCS and permits a natural modelling of mobility (i.e., dynamic reconfigurations of the process linkage) using communication of names. Previous research has shown that the-calculus has much greater expressiveness than CCS, but also a much more complex mathematical theory. The primary goal of this work is to understand the reasons of this gap. Another goal is to compare the expressiveness of name-passing calculi, i.e., calculi like-calculus where mobility is achieved via exchange of names, and that of agent-passing calculi, i.e., calculi where mobility is achieved via exchange of agents. We separate the mobility mechanisms of the-calculus into two, respectively called internal mobility and external mobility. The study of the subcalculus which only uses internal mobility, called I, suggests that internal mobility is responsible for much of the expressiveness of the-calculus, whereas external mobility is responsible for many of the semantic complications. A pleasant property of I is the full symmetry between input and output constructs. Internal mobility is strongly related to agent-passing mobility. By imposing bounds on the order of the types of I and of the Higher-Order-calculus [San92] we define a hierarchy of name-passing calculi based on internal mobility and one of agent-passing calculi. We show that there is an exact correspondence, in terms of expressiveness, between the two hierarchies. 1

Citations

2762 Communication and Concurrency – Milner - 1989
886 A Calculus of Mobile Processes – Milner, Parrow, et al. - 1992
316 The polyadic -calculus: a tutorial – Milner - 1991
281 Functions as processes – Milner - 1992
245 The Lambda-Calculus, its Syntax and Semantics, volume 103 – Barendregt - 1984
232 Expressing Mobility in Process Algebras: First-Order and HigherOrder Paradigms – Sangiorgi - 1992
220 Typing and subtyping for mobile processes – Pierce, Sangiorgi - 1996
203 The lazy lambda calculus – Abramsky - 1990
190 Algebra of communicating processes with abstraction – Bergstra, Klop - 1985
125 Fundamental properties of infinite trees – Courcelle - 1983
49 A π-calculus semantics for an object-based design notation – Jones - 1993
47 A fully abstract denotational model for higher-order processes – Hennessy - 1994
29 Locality and non-interleaving semantics in calculi for mobile processes – Sangiorgi - 1996
26 A fully abstract semantics for causality in the -calculus – Boreale, Sangiorgi - 1995
24 Lazy functions and mobile processes – Sangiorgi - 1995
19 Action Calculi, or Syntactic Action Structures – Milner - 1993
11 On the reduction of chocs bisimulation to ��-calculus bisimulation – Amadio - 1993
9 Observational structures and their logic – Astesiano, Giovini, et al. - 1992
5 A -calculus with explicit substitutions: the late semantics – Ferrari, Montanari, et al. - 1994
3 Applications of the calculus of trees to process description languages – Degano, Kasangian, et al. - 1991
2 Dynamic classification of action calculi. Handwritten notes – Milner - 1994