On the expressiveness of synchronization in component deployment

Jacopo Mauro, Gianluigi Zavattaro*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

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.

Original languageEnglish
Title of host publicationTheory and Practice of Formal Methods - Essays Dedicated to Frank de Boer on the Occasion of His 60th Birthday
EditorsErika Ábrahám, Einar Broch Johnsen, Marcello Bonsangue
Number of pages16
PublisherSpringer
Publication date1. Jan 2016
Pages344-359
ISBN (Print)9783319307336
DOIs
Publication statusPublished - 1. Jan 2016
Externally publishedYes
EventFrank de Boer on the Occasion of His 60th Birthday, 2016 - Porto, Portugal
Duration: 5. Jul 20165. Jul 2016

Conference

ConferenceFrank de Boer on the Occasion of His 60th Birthday, 2016
Country/TerritoryPortugal
CityPorto
Period05/07/201605/07/2016
SeriesLecture Notes in Computer Science
Volume9660
ISSN0302-9743

Fingerprint

Dive into the research topics of 'On the expressiveness of synchronization in component deployment'. Together they form a unique fingerprint.

Cite this