Adaptable processes

Mario Bravetti*, Cinzia Di Giusto, Jorge A. Perez, Gianluigi Zavattaro

*Bijbehorende auteur voor dit werk

OnderzoeksoutputAcademicpeer review

29 Citaten (Scopus)
159 Downloads (Pure)


We propose the concept of a daptable 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 run ning 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 concurrent processes. We introduce a core calculus of adaptable processes and propose two verification problems for them: bounded and eventual adaptation. While the former ensures that the number of consecutive erroneous states that can be traversed during a computation is bound by some given number k, the latter ensures that if the system enters into a state with errors then a state without errors will be eventually reached. We study the (un) decidability of these two problems in several variants of the calculus, which result from considering dynamic and static topologies of adaptable processes as well as different evolvability patterns. Rather than a specification language, our calculus intends to be a basis for investigating the fundamental properties of evolvable processes and for developing richer languages with evolvability capabilities.

Originele taal-2English
Aantal pagina's71
TijdschriftLogical Methods in Computer Science
Nummer van het tijdschrift4
StatusPublished - 19-nov-2012

Citeer dit