Checking Properties along Multiple Reconfiguration Paths for Component-Based Systems

Jean-Michel Hufflen

Reconfiguration paths 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.

In Jan Kofroň and Jana Tumova: Proceedings International Workshop on Formal Engineering approaches to Software Components and Architectures (FESCA 2017), Uppsala, Sweden, 22nd April 2017, Electronic Proceedings in Theoretical Computer Science 245, pp. 52–66.
Published: 20th March 2017.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: