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.
Cite
CITATION STYLE
Mauro, J., & Zavattaro, G. (2015). On the complexity of reconfiguration in systems with legacy components. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9234, pp. 382–393). Springer Verlag. https://doi.org/10.1007/978-3-662-48057-1_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
