On the Expressiveness of Synchronization in Component Deployment - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2016

On the Expressiveness of Synchronization in Component Deployment

Abstract

The Aeolus component problem of automatic deployment of complex distributed component systems. In the general setting, the task of checking if a distributed application can be deployed is an undecidable problem. However, the current undecidability proof in Aeolus assumes the possibility to perform in a synchronized way atomic configuration actions on a set of interdependent components: this feature is usually not supported by deployment frameworks. In this paper we prove that even without synchronized configuration actions the Aeolus component model is still Turing complete. On the contrary, we show that other Aeolus features like capacity constraints and conflicts are necessary: if we remove the former the deployment problem becomes non-primitive recursive, while in the latter it becomes poly-time.
Fichier principal
Vignette du fichier
DeBoerFest.pdf (467.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01334772 , version 1 (21-06-2016)

Identifiers

Cite

Jacopo Mauro, Gianluigi Zavattaro. On the Expressiveness of Synchronization in Component Deployment. Theory and Practice of Formal Methods , 9660 pp.344-359, 2016, Lecture Notes in Computer Science, ⟨10.1007/978-3-319-30734-3⟩. ⟨hal-01334772⟩
66 View
175 Download

Altmetric

Share

Gmail Facebook X LinkedIn More