Cours Concurrence DEA

Academic Year 2003-2004

1. Shared memory (Jean-Jacques Lévy) [Ps, Pdf]

2. Interaction (Jean-Jacques Lévy) [Ps, Pdf]

3. CCS (Jean-Jacques Lévy) [Ps, Pdf]

4. Bisimulations (Jean-Jacques Lévy) [Ps, Pdf]

5. The equality theory of CCS (Catuscia Palamidessi) [ppt, pdf, ps]

6. Specification and verification in CCS (Catuscia Palamidessi) [ppt, pdf, ps]

7. The expressive power of CCS (Catuscia Palamidessi) [ppt, pdf, ps]

8. The pi-calculus (Catuscia Palamidessi) [ppt, pdf, ps]

9. The asynchronous pi-calculus (Catuscia Palamidessi) [ppt, pdf, ps]

10. Exercises (Catuscia Palamidessi) [ps, pdf]

Exercises

• Exercises by James Leifer [ps, pdf]

Examen

• Text [ps, pdf]
• Solution [ps, pdf]

Examens des années précédentes

• 2002-03 [ps]

Cours des années précédentes

• Davide Sangiorgi [Ps]

• Pierre-Louis Curien [Ps]

Books

• Robin Milner. Communication and Concurrency. Prentice Hall International, 1989.
• Robin Milner. Communicating and mobile systems: the pi-calculus. Cambridge University Press, 1999.
• Davide Sangiorgi and David Walker. The pi-calculus. A Theory of Mobile Processes. Cambridge University Press, 2001.

Papers

• R. Milner, J. Parrow, D. Walker. Modal Logics for Mobile Processes. Theoretical Computer Science 114:149-171, 1993. [pdf, ps]
• Catuscia Palamidessi. Comparing the expressive power of the Synchronous and the Asynchronous pi-calculus. Proc. of the 24th ACM Symposium on Principles of Programming Languages (POPL), pages 256-265, ACM, 1997. [ps]
• Benjamin Pierce. Foundational Calculi for Programming Languages. Chapter in the CRC Handbook of Computer Science and Engineering, 1996. [ps]