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

Jean-Michel Hufflen
(FEMTO-ST & University of Franche-Comté)

Within a component-based approach allowing dynamic reconfigurations, sequences of successive reconfiguration operations are expressed by means of reconfiguration paths, possibly infinite. We show that a subclass of such paths can be modelled by finite state automata. This feature allows us to use techniques related to model-checking to prove some architectural, event, and temporal properties related to dynamic reconfiguration. Our method is proved correct w.r.t. these properties' definition.

In Bara Buhnova, Lucia Happe and Jan Kofroň: Proceedings 12th International Workshop on Formal Engineering approaches to Software Components and Architectures (FESCA 2015), London, United Kingdom, April 12th, 2015, Electronic Proceedings in Theoretical Computer Science 178, pp. 33–46.
Published: 17th March 2015.

ArXived at: http://dx.doi.org/10.4204/EPTCS.178.4 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org