Skip to Main content Skip to Navigation

On the Complexity of Reconfiguration in Systems with Legacy Components

Jacopo Mauro 1, 2 Gianluigi Zavattaro 1, 2
1 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : In previous works we have proved that component reconfiguration in the presence of conflicts among components is non-primitive recursive, while it becomes poly-time if there are no conflicts and under the assumption that there are no components in the initial configuration. The case with non-empty initial configurations was left as an open problem, that we close in this paper by showing that, if there are legacy components that cannot be generated from scratch, the problem turns out to be PSpace-complete.
Document type :
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Jacopo Mauro Connect in order to contact the contributor
Submitted on : Friday, June 5, 2015 - 11:25:25 AM
Last modification on : Friday, October 30, 2020 - 12:04:03 PM
Long-term archiving on: : Tuesday, April 25, 2017 - 3:19:37 AM


Files produced by the author(s)


  • HAL Id : hal-01160369, version 1



Jacopo Mauro, Gianluigi Zavattaro. On the Complexity of Reconfiguration in Systems with Legacy Components. [Technical Report] INRIA Sophia Antipolis. 2015. ⟨hal-01160369⟩



Les métriques sont temporairement indisponibles