D.5.a Hierarchical graph models of extended core calculi

This document overviews various graph-based approaches to the representation of service-oriented calculi with inherently-hierarchical aspects such as nested sessions. A first, more detailed, part proposes a modelling approach based on a formalism developed in Sensoria, called Architectural Design Rewriting. A second part offers a brief description of approaches based on models developed outside Sensoria and well established in the community working on process algebras and concurrency theory, namely GS-monoidal categories and Bigraphs. A novel correspondence between these two formalisms is also outlined. Both approaches are illustrated with the session calculus CaSPiS, which stems from the SCC-family of core calculi developed in Work Package 2.

D5.1.a Process Calculi and Coordination Languages with Costs, Priority and Probability (first version)

The intention was the definition of new primitives that provide proper mechanisms for resource acquisition, access control, timeliness and for combining different and even contrasting SLA requirements in a flexible way. Thus, core calculi will be extended to include QoS attributes as first-class objects, equipped with rigorous semantic foundations and analytical tools to prove correctness of system specifications and to enable formal verification. The plan was to study mechanisms to derive SLA requirements, including overall cost, performance, security, reliability, and availability of a composite service from those of its components.

D5.2.a Model-driven development of Long Running Transactions

In the last years the management of transactional aspects for Service-Oriented Computing became a key issue. In a such context, particular relevance is given to the so called Long Running Transactions (LRT). Here, we promote a formal approach to the specification and refactoring of LRT that is the result of practical experimentation of formal calculi for coordinating services. Finally, the given refactoring rules are sound as they preserve (weak) bisimilarity.

D5.3.a Reconfigurations Preserving Architectural Types and Shapes

SOC architectural styles support loosely coupled services to enable business flexibility, allowing dynamically reconfigurable end-to-end business processes realization. This report describes two lines of work dealing with software architectures and their reconfigurations. The first one is architectural shapes and introduces a formal model for the specification of consistent reconfigurations, and the second one is architectural programming and deals with the introduction of architectural concepts into a programming language for coping with architectural erosion.

D5.3.b Requirements for Automated Reconfiguration and Specification of Policy Run-time Support

The document reports on the progress done regarding the dynamic reconfiguration and specifications of run-time policies.The efforts have mainly covered all the goals and uncovered issues are subject to current work. More precisely, it was developed an approach called Architectural Design Rewriting (ADR), which enhances the formalism presented in deliverable D5.3.a by a novel, simpler and more powerful algebraic presentation. Furthermore the design and reconfiguration of SRML specifications using ADR is modelled. Finally a goal-oriented orchestration language (GOOL) tailored to specify policies in service-oriented applications was defined.