Towards Dynamic Adaptation of Probabilistic Systems

Formal Aspects of Component Software

2012

Self Cite

Abstract. Adaptation of a component-based system can be achieved in the coordination modelling language Paradigm through the special component McPal. McPal regulates the propagation of new behaviour and guides the changes in the components and in their coordination. Here we show how McPal may delegate part of its control to local adaptation managers, created on-the-fly, allowing for distribution of the adaptation indeed. We illustrate the approach for the well-known example of the dining philosophers problem, by modelling the migration from a deadlock-prone solution to a deadlock-free starvation-free solution without any system quiescence. The adaptation goes through various stages, exhibiting shifting control among McPal and its helpers, and changing degrees of orchestrated and choreographic collaboration.

Section: Dining Philosophers As-is: Deadlock-pronementioning

confidence: 96%

Distributed Adaption of Dining Philosophers

Formal Aspects of Component Software

2012

Self Cite

Section: Dining Philosophers As-is: Deadlock-pronementioning

confidence: 99%

“…In [28,5,8] we advocated how orchestrated adaptation can conveniently be captured in the coordination modeling language Paradigm (backed up by a translation into the specification languages of the model checkers mCRL2 and Prism). In Paradigm, a system architecture is organized along specific collaboration dimensions, called partitions.…”

Section: Introductionmentioning

confidence: 99%

Dynamic adaptation with distributed control in Paradigm

Science of Computer Programming

2014

Self Cite

Adaptation of a component-based system can be achieved in the coordination modeling language Paradigm through the special component McPal. McPal regulates the propagation of new behaviour and guides the changes in the components and in their coordination. Here we show how McPal may delegate part of its control to local adaptation managers, created on-the-fly, allowing for distribution of the adaptation indeed. We illustrate the approach for the well-known example of the dining philosophers problem, by modeling migration from a deadlock-prone solution to a deadlock-free and starvation-free solution without any system quiescence. The system migration goes through various stages, exhibiting a shift of control among McPal and its helpers, and changing degrees of orchestrated and choreographic collaboration. The distributed system adaptation is formally verified using the mCRL2 model checker.

“…Interactions are in terms of temporary constraints on the dynamics of components. To underpin Paradigm models with formal verification and automated analysis, the Paradigm language has been linked with the mCRL2 toolset [11] via its translation to the process algebra ACP [6,3] and with the probabilistic modelchecker Prism [15,4] via a direct encoding scheme. Process algebras (PA for short), such as CCS, CSP, LOTOS and ACP, provide a powerful framework for formal modeling and reasoning about concurrent systems, which turns out to be very suitable for our needs in the setting of coordination.…”

Section: Introductionmentioning

confidence: 99%

“…While the translation to ACP and mCRL2 allows for formal verification of Paradigm models [3,2,4], the omnipresent problem of state space explosion when analyzing large models occurs here as well. In the present paper, we address the question of reducing Paradigm models of coordination.…”

Section: Introductionmentioning

confidence: 99%

Towards reduction of Paradigm coordination models

Electron. Proc. Theor. Comput. Sci.

2011

The coordination modelling language Paradigm addresses collaboration between components in terms of dynamic constraints. Within a Paradigm model, component dynamics are consistently specified at a detailed and a global level of abstraction. To enable automated verification of Paradigm models, a translation of Paradigm into process algebra has been defined in previous work. In this paper we investigate, guided by a client-server example, reduction of Paradigm models based on a notion of global inertness. Representation of Paradigm models as process algebraic specifications helps to establish a property-preserving equivalence relation between the original and the reduced Paradigm model. Experiments indicate that in this way larger Paradigm models can be analyzed.