A calculus of communicating systems with label passing - ten years after

This note is dedicated to Robin Milner. We take the opportunity of looking back on a ten year old report of ours on an extension of CCS with label passing.

[1]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[2]  Thomas W. Doeppner,et al.  A formal description of the UNIX operating system , 1983, PODC '83.

[3]  Robin Milner,et al.  Functions as processes , 1990, Mathematical Structures in Computer Science.

[4]  Robin Milner,et al.  Lectures on a Calculus for Communicating Systems , 1984, Seminar on Concurrency.

[5]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[6]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[7]  D. Walker,et al.  A Calculus of Mobile Processes, Part Ii , 1989 .

[8]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, Theor. Comput. Sci..

[9]  David Walker,et al.  Pi-Calculus Semantics of Object-Oriented Programming Languages , 1991, TACS.

[10]  Mads Tofte,et al.  A Calculus of Communicating Systems with Label Passing—Ten Years After , 2000 .

[11]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[12]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[13]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[14]  Elena Zucca,et al.  Parametric Channels via Label Expressions in CCS , 1984, Theor. Comput. Sci..

[15]  Cliff B. Jones.  A pi-Calculus Semantics for an Object-Based Design Notation , 1993, CONCUR.