Abstract
Software systems nowadays require continuous operation despite changes both in user needs and in their operational environments. Self-adaptive systems are typically instrumented with tools to autonomously perform adaptation to these changes while maintaining some desired properties. In this chapter, we model and analyse selfadaptive systems by means of typed, attributed graph grammars. The interplay of different grammars representing the application and the adaptation logic is realised by an adaptation manager. Within this formal framework we define consistency and operational properties that are maintained despite adaptations, and we give static conditions for their verification. The overall approach is supported by AGG 2.0 (see Sect. 12.1). A case study modelling a business process that adapts to changing environment conditions is used to demonstrate and validate the formal framework [BKM+12]. The modelling framework described in this chapter is based on joint work of the authors with Antonio Bucchiarone, Patrizio Pellicione and Olga Runge [EER+10, BEE+13, BEE+15].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ehrig, H., Ermel, C., Golas, U., Hermann, F. (2015). Modelling and Static Analysis of Self-adaptive Systems by Graph Transformation. In: Graph and Model Transformation. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47980-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-47980-3_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47979-7
Online ISBN: 978-3-662-47980-3
eBook Packages: Computer ScienceComputer Science (R0)