Article ID Journal Published Year Pages File Type
422754 Electronic Notes in Theoretical Computer Science 2006 13 Pages PDF
Abstract

Growing the need for long-life and high-available programs, dynamic reconfiguration is going to be an important research issue. Dynamic reconfiguration enables the software systems to change at runtime to decrease their down-time in case of any updating, upgrading or in any changes. Any invalid reconfiguration at runtime may lead programs into invalid states. In this paper, we investigate on validity of dynamic reconfiguration for component-based programs and propose validity conditions for it. We show that the problem of validity assurance in general is undecidable and there is no general-purpose algorithm to verify dynamic reconfiguration validity. To have a computable algorithm for validity check we present some sufficient conditions for achieving validity.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics