A Calculus of Mobile Processes, Part I (1989) [161 citations — 2 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Robin Milner and Joachim Parrow and David Walker},
title = {A Calculus of Mobile Processes, Part I},
journal = {I and II. Information and Computation},
year = {1989},
volume = {100}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
: We present the ß-calculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The calculus is an extension of the process algebra CCS, following work by Engberg and Nielsen who added mobility to CCS while preserving its algebraic properties. The ß-calculus gains simplicity by removing all distinction between variables and constants; communication links are identified by names, and computation is represented purely as the communication of names across links. After an illustrated description of how the ß-calculus generalises conventional process algebras in treating mobility, several examples exploiting mobility are given in some detail. The important examples are the encoding into the ß- calculus of higher-order functions (the -calculus and combinatory algebra), the tr...
Citations
| 2701 | Communication and Concurrency – Milner - 1989 |
| 847 | A calculus of mobile processes – Milner, Parrow, et al. - 1992 |
| 197 | The lazy lambda calculus – Abramsky - 1977 |
| 184 | Algebra of communicating processes with abstraction. TCS – Bergstra, Klop - 1985 |
| 56 | Towards a lambda-calculus for concurrent and communicating systems – Boudol - 1989 |
| 50 | Foundations of Actor Semantics – Clinger - 1981 |
| 50 | A calculus of communicating systems with label-passing – Engberg, Nielsen - 1986 |
| 25 | A Calculus of Higher-order Communicating Systems – Thomsen - 1989 |
| 13 | Parametric channels via label expressions in CCS.J – Astesiano, Zucca - 1984 |
| 13 | Functions as processes. Research Report 1154, INRIA, Sophia Antipolis – Milner - 1990 |
| 12 | Fully Abstract Models of the Lazy Lambda Calculus – Ong - 1988 |
| 4 | Cell and ensemble architecture of the Rewrite Rule Machine – Leinwand, Goguen, et al. - 1988 |
| 1 | The Typed -calculus with First-class – Nielson - 1988 |
| 1 | The Zero Assignment Parallel – Sleep, Kennaway - 1984 |
