Checking Properties along Multiple Reconfiguration Paths for Component-Based Systems

Abstract

Reconfiguration paths are used to express sequences of successive reconfiguration operations within a component-based approach allowing dynamic reconfigurations. We use constructs from regular expressions-in particular, alternatives-to introduce multiple reconfiguration paths. We show how to put into action procedures allowing architectural, event, and temporal properties to be proved. Our method, related to finite state automata and using marking techniques, generalises what we did within previous work, where the regular expressions we processed were more restricted. But we can only deal with a subset of first-order logic formulas.

Using Model-Checking Techniques for Component-Based Systems with Reconfigurations

“…Within the framework sketched at § 3.2, our automata have been implemented using the Scheme programming language [24]. The complete implementation can be found in [14], and [15] describes our functions in a way closer to this implementation, giving more details about the Scheme structures we used. The descriptions of this paper allow us to be more related to a theoretical model, and to emphasise that our method is close to algorithms based on marks and used in model-checking, e.g., [6,7,23].…”

“…We use a high-level functional pseudo-language, except for updating marks, which is done by means of side effects. A complete implementation is available at [14], including other features of FTPL, with similar programming techniques and similar methods for proving the termination of our functions and the correctness w.r.t. the definitions given in [9,10].…”

“…the operators defined in Section 2. In this article, we do not examine the implementation of all the operators-given in [14]-but our examples are representative. Section 5 discusses some advantages and drawbacks of our method, in comparison with other approaches.…”