Saarland University
Computer Science
Programming Systems
Teaching
Communicating Systems


Main page
Literature
Participants
Programme

Theory of Communicating Systems: Literature

Basic reading

• Robin Milner, Communicating and Mobile Systems: the Pi-Calculus, Cambridge University Press, 1999.
• Robin Milner, Communication and Concurrency, Prentice Hall, 1989.

A more advanced book:

• Davide Sangiorgi, David Walker, The Pi-Calculus, A Theory of Mobile Processes, Cambridge University Press, 2001.

Some background reading:

• An interview with Robin Milner
• J.C.M. Baeten, Brief History of Process Algebra, Rapport CSR 04-02, Technische Universiteit Eindhoven 2004.

Logics for Concurrency

• Robin Milner, Specifications and Logic, Chapter 10 of Communication and Concurrency, Prentice Hall, 1989.
• Luis Caires and Luca Cardelli, A Spatial Logic for Concurrency (Part I), Information and Computation 186(2):194-235, 2003.

Computational aspects

• Matthew Hennessy and Huimin Lin, Symbolic Bisimulations, Theoretical Computer Science, 138(2):353-389, 1995.
• Gerardo Costa and Colin Stirling, Weak and Strong Fairness in CCS, Information and Computation 73:207-244, 1987.

Distributed computation, mobility, and failure

• James Riely and Matthew Hennessy Distributed Processes and Location Failures, Theoretical Computer Science, 226:693-735, 2001.
• Luca Cardelli and Andrew Gordon, Mobile Ambients, Theoretical Computer Science 240:177-213, 2001.
• Adrian Francalanza and Matthew Hennessy A Theory of Observational Fault Tolerance, pages 16-31 of Proc. Fossacs'06, vol 3921 of Lecture Notes in Computer Science, Springer, 2006.

Pi calculus and security modelling

• Martín Abadi and Andrew Gordon, A Calculus for Cryptographic Protocols: The spi Calculus, Information and Computation, 148:1-70, 1999.
• Matthew Hennessy, The Security pi-Calculus and Non-interference, Journal of Logic and Algebraic Programming 63(1):3-34, 2005.

Pi calculus and biological modelling

• Aviv Regev, Ehud Shapiro, The pi-Calculus as an Abstraction for Biomolecular Systems. In G. Ciobanu, G. Rozenberg (Eds.): "Modelling in Molecular Biology" pages 219-266, Natural Computing Series, Springer, 2004.
• Andrew Phillips, Luca Cardelli, Giuseppe Castagna, A Graphical Representation for Biological Processes in the Stochastic pi-Calculus, pages 123-152 of Transactions on Computational Systems Biology VII, vol 4230 of Lecture Notes in Computer Science, Springer, 2006.

Types in the pi-calculus

• Martin Berger, Kohei Honda and Nobuko Yoshida, Sequentiality and the pi-Calculus, Proc. TLCA'01, Lecture Notes in Computer Science, Springer, 2001.
• Naoki Kobayashi, A New Type System for Deadlock-Free Processes, pages 233-247 of Proceedings CONCUR'06, vol 4137 of Lecture Notes in Computer Science, Springer, 2006.
• Davide Sangiorgi, The Name Discipline of Uniform Receptiveness, Theoretical Computer Science 221(1-2): 457-493, 1999.
• Nobuko Yoshida and Matthew Hennessy, Assigning Types to Processes, Information and Computation 174(2):143-179, 2004.

Programming languages as communicating systems

• Robin Milner, Sorts, Objects and Functions, Chapter 11 of Communicating and Mobile Systems, Cambridge University Press, 1999.
• Jan J.M.M. Rutten, A note on Coinduction and Weak Bisimilarity for While Programs, Theoretical Informatics and Applications (RAIRO), 33:393-400, 1999.
• Andrew Gordon, A Tutorial on Co-induction and Functional Programming, Proceedings of the 1994 Glasgow Workshop on Functional Programming, pages 78-95.
• Benjamin C. Pierce and David N. Turner, Pict: A Programming Language Based on the Pi-Calculus. In Gordon Plotkin, Colin Stirling, and Mads Tofte (Eds.): "Proof, Language and Interaction: Essays in Honour of Robin Milner", pages 455-494, MIT Press, 2000.