Abstract. The goal of this roadmap paper is to summarize the stateof-the-art and identify research challenges when developing, deploying and managing self-adaptive software systems. Instead of dealing with a wide range of topics associated with the field, we focus on four essential topics of self-adaptation: design space for self-adaptive solutions, software engineering processes for self-adaptive systems, from centralized to decentralized control, and practical run-time verification & validation for self-adaptive systems. For each topic, we present an overview, suggest future directions, and focus on selected challenges. This paper complements and extends a previous roadmap on software engineering for self-adaptive systems published in 2009 covering a different set of topics, and reflecting in part on the previous paper. This roadmap is one of the many results of the Dagstuhl Seminar 10431 on Software Engineering for Self-Adaptive Systems, which took place in October 2010.

Abstract. We report on a formal framework being developed within the SEN-SORIA project for supporting service-oriented modelling at high levels of abstraction, i.e. independently of the hosting middleware and hardware platforms, and the languages in which services are programmed. More specifically, we give an account of the concepts and techniques that support the composition model of SENSORIA, i.e. the mechanisms through which complex applications can be put together from simpler components, including modelling primitives for the orchestration of components and the definition of external interfaces.

A categorical semantics is proposed for the notion of architectural connector in the style defined by Allen and Garlan which adopts notions of parameterisation similar to those developed for Abstract Data Type specification, and adapts them to formalisms for parallel program design. We show how many of the claims made in [1] can be formally substantiated, and generalised to formalisms other than CSP. Finally, we show how the categorical formalisation lends itself to useful generalisations of the notion of connector, namely through the use of multiple formalisms in the definition of the glue and the roles. 9 R is the set of read-only attributes used by the program (i.e. attributes that are to be instantiated with local attributes of other components in the environment); each attribute is typed by a data sort in S; 9 F is the set of action names; each action name has an associated statement (see below) and can act as a rendezvous point for program synchronisation; 9 I is a condition on the attributes-the initialisation condition; 9 for every action ge F, B(g) is a condition on the attributes-its guard; 9 for every action gc F and attribute a~ D(g), F(g,a) is an expression denoting a set; each time g is executed, a is assigned one of the values denoted by F(g,a), chosen in a non-deterministic way. Definition 2.1: A program signature is a triple where 9 Z is a signature in the usual algebraic sense [6]-S is a set (of sort symbols) and g2 is an S*xS-indexed family (of function symbols). 9 V and R are S-indexed families of sets where S is the set of sorts. 9 F is a 2V-indexed family of sets. We denote by D(g) the type of each g in F (the set of attributes that action g can change). We also denote by D(a), where a~ V, the set of actions that can change a, i.e., D(a)={ ge F:a~ D(g)}. All these sets of symbols are assumed to be finite and mutually disjoint. | Definition 2.2: A program is a pair <0,A> where 0 is a signature and A, the body of the program, is a quadruple where

For several different reasons, such as changes in the business or technological environment, the configuration of a system may need to evolve during execution. Support for such evolution can be conceived in terms of a language for specifying the dynamic reconfiguration of systems. In this paper, continuing our work on the development of a formal platform for architectural design, we present a high-level language to describe architectures and for operating changes over a configuration (i.e., an architecture instance), such as adding, removing or substituting components or interconnections. The language follows an imperative style and builds on a semantic domain established in previous work. Therein, we model architectures through categorical diagrams and dynamic reconfiguration through algebraic graph rewriting.

No abstract