Adaptable processes

We 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 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

On the Computation Power of Name Parameterization in Higher-order Processes

Parameterization extends higher-order processes with the capability of abstraction (akin to that in lambda-calculus), and is known to be able to enhance the expressiveness. This paper focuses on the parameterization of names, i.e. a construct that maps a name to a process, in the higher-order setting. We provide two results concerning its computation capacity. First, name parameterization brings up a complete model, in the sense that it can express an elementary interactive model with built-in recursive functions. Second, we compare name parameterization with the well-known pi-calculus, and provide two encodings between them.Comment: In Proceedings ICE 2015, arXiv:1508.0459

A Cartan-Eilenberg approach to Homotopical Algebra

In this paper we propose an approach to homotopical algebra where the basic ingredient is a category with two classes of distinguished morphisms: strong and weak equivalences. These data determine the cofibrant objects by an extension property analogous to the classical lifting property of projective modules. We define a Cartan-Eilenberg category as a category with strong and weak equivalences such that there is an equivalence between its localization with respect to weak equivalences and the localised category of cofibrant objets with respect to strong equivalences. This equivalence allows us to extend the classical theory of derived additive functors to this non additive setting. The main examples include Quillen model categories and functor categories with a triple, in the last case we find examples in which the class of strong equivalences is not determined by a homotopy relation. Among other applications, we prove the existence of filtered minimal models for \emph{cdg} algebras over a zero-characteristic field and we formulate an acyclic models theorem for non additive functors