Towards a mobile CSP

Bill Roscoe (OUCL)

Info

Date	1st December 2010 (week 8, Michaelmas Term 2010)
Time	11:30
Place	Room 147, Oxford University Computing Laboratory

Abstract

I will go through some of the material in Chapter 20 of my new book.

I'll examine the problem of programming Warnsdorff's algorithm for the knight's tour problem, discuss three ways in which we might achieve the prioritised execution required for that, and show how one of them creates a CSP script which has qualities one might only expect to be able to achieve in a mobile version of CSP.

I'll then discuss how to extend this idea to a limited but useful concept of mobile parallel composition and give an example based on telephony.