University of Edinburgh
Department of Computer Science
Courses on Mobile Processes
Basics of Mobile Processes
From February 12th to 13th
Basic elements of calculi of mobile processes, including the
fundamentals of their bisimilarities. Among various results, I will
especially stress on their expressive power, in terms of both concrete
examples and formal results (including combinator results). The
material to be covered will be either standard or well-established,
but perhaps from a fresh viewpoint. If time allows, I may also give a
little detailed treatment of basic semantic results on the (now
fashionable) nu-calculus, a.k.a. asynchronous pi-calculus.
Types for Mobile Processes
From February 17th to 19th
Here we go from the sorting and its type inference, its various
refinements and their use, and how we can understand the idea of
"types for processes" in the line of "types for functions", i.e.
types for higher-order functional calculi, through semantic
observations. This will be basically a solid presentation of basic
results, combined, at the end, with somewhat new and abstract ideas.
Symmetries in Processes
This discusses what I call theory of process structures, in which the
notion of symmetries plays an essential role, and its applications. In
particular I will show how it can be used to understand the foregoing
theories of processes (in particular of mobile processes) and
functions, on a uniform framework, as well as how it can be applied to
a concrete problem of reasoning about processes.
When: From February 12th, 1997, 9:30 - 12:30AM.
Where: Room 2.25, Instituto Física-Matemática,
Av. Gama Pinto 2, 1600 Lisboa.