On the Expressiveness of Synchronization in Component Deployment

Jacopo Mauro 1 Gianluigi Zavattaro 2, 3, *
* Corresponding author
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
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.
Document type :
Book sections
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01334772
Contributor : Zavattaro Gianluigi <>
Submitted on : Tuesday, June 21, 2016 - 1:04:52 PM
Last modification on : Wednesday, October 10, 2018 - 10:09:05 AM
Long-term archiving on : Thursday, September 22, 2016 - 1:24:14 PM

File

DeBoerFest.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

147

Files downloads

169