Projects for the mobile processes course

Here are some suggestions for projects. Please note on this page if you are interested, and come and discuss the project with Björn or Joachim. Of course you can also come up with projects yourself!

Implementation

• late bisimulation (in MWB, using on-the-fly algorithm)
• partition refinement algorithms for {open,late,early} {strong,weak} equivalence (in MWB, using Pistore & Sangiorgi's work (extended abstract, full version)) - an implementation for open already exists, but it would be nice to incorporate it into the MWB!
• sorted/typed equivalence (in MWB)
• late minimization (in MIHDA)
• HD-to-pi compilation
• replication operator (in MWB, using ideas from Solo Diagrams by Laneve, Parrow and Victor)
• dynamic binding and blocking operators (see José-Luis Vivas thesis)

Case studies

• analyse security protocols (e.g. using STA or TRUST, which can be found at the PROFUNDIS web page. For example protocols, see e.g. ePrint Archive)
• encode spi-calculus in pi-calculus and analyse simple security protocols using e.g. MWB (for the encoding, talk to Joachim or Björn) - Oskar and Mayank are doing this project

Presentations

Study an area of mobile process calculi, e.g. by reading a chapter of Sangiorgi & Walker, or a substantial article, and present at a seminar. Examples:

• Asynchronous pi-calculus
• Typed pi-calculi
• Higher-Order pi-calculus
• Objects in pi-calculus