Detail

Adaptable Processes

In this talk, I will propose the concept of adaptable processes as a
way of overcoming the limitations that process calculi have for
describing patterns of dynamic process evolution. Such patterns rely
on direct ways of controlling the behavior and location of running
processes, and so they are at the heart of the adaptation capabilities
present in many modern concurrent systems. Adaptable processes have a
location and are sensible to actions of dynamic update at runtime.
This allows to express a wide range of evolvability patterns for processes.

First, I will introduce a core process calculus of adaptable
processes. It is defined as an extension of Milner’s CCS with
constructs for updating located processes at runtime.
Then, I will describe two verification problems for adaptable
processes: bounded and eventual adaptation.
While the former ensures that at most k consecutive errors will arise
in future states, the latter ensures that if the system enters into an
error state then it will eventually reach a correct state.
Finally, I will present some expressiveness and (un)decidability of
these two problems in different fragments of the calculus.