Skip to main content
Log in

Temporal plans for software architecture reconfiguration

  • Special Issue Paper
  • Published:
Computer Science - Research and Development

Abstract

Self-adaptive systems have the ability to autonomously reconfigure their structure in order to meet specific goals. Such systems often include a planning component, which computes plans of reconfiguration steps. However, despite the fact that reconfigurations take time in reality, most planning approaches for self-adaptive systems are non-temporal. In this paper, we present a model-based approach to the generation of temporal reconfiguration plans. Besides allowing for durative reconfigurations, our technique also neatly solves concurrency issues arising in such a temporal setting. This provides the modeler with a clear and easy-to-use basis for modeling while at the same time giving an automatic method for plan construction.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Notes

  1. http://projects.ikv.de/qvt/wiki.

  2. POPF2 does allow the negation of static facts, e.g. equality, though.

  3. See http://www.plg.inf.uc3m.es/ipc2011-deterministic/ParticipatingPlanners for information on temporal planners that participated in the 7th International Planning Competition, 2011.

  4. We verified this assumption by a comparison with a modified domain. The modified domain included a predicate for the order of RailCabs, additional goal literals typed over this predicate, and action schemata that allow to create such literals.

  5. In PDDL, a literal that is going to be deleted by an action does not have to be present if it is not required in the precondition. In such a case the action is still applicable, but does not change the literal.

References

  1. Alur R, Dill DL (1994) A theory of timed automata. Theor Comput Sci 126:183–235

    Article  MathSciNet  MATH  Google Scholar 

  2. Becker B, Beyer D, Giese H, Klein F, Schilling D (2006) Symbolic invariant verification for systems with dynamic structural adaptation. In: 28th international conference on software engineering (ICSE 2006). ACM Press, New York

  3. Becker S, Brenner C, Brink C, Dziwok S, Löffler R, Heinzemann C, Pohlmann U, Schäfer W, Suck J, Sudmann O (2012) The MechatronicUML design method - process, syntax, and semantics. Technical Report tr-ri-12-326, Software Engineering Group, Heinz Nixdorf Institute, University of Paderborn

  4. Bernstein PA, Hadzilacos V, Goodman N (1987) Concurrency control and recovery in database systems. Addison-Wesley Publishing Company, Boston

    Google Scholar 

  5. Bradbury JS, Cordy JR, Dingel J, Wermelinger M (2004) A survey of self-management in dynamic software architecture specification. In: ACM SIGSOFT workshop on self-managed systems (WOSS 2004)

  6. Chen Y, Wah BW, Hsu CW (2006) Temporal planning using subgoal partitioning and resolution in SGPlan. J Artif Intell Res 26:323–369

    Google Scholar 

  7. Coles AJ, Coles AI, Fox M, Long D (2010) Forward-chaining partial-order planning. In: 20th international conference on automated planning and scheduling (ICAPS 2010)

  8. Cushing W, Kambhampati S, Mausam Weld DS (2007) When is temporal planning really temporal? In: 20th international joint conference on artificial intelligence (IJCAI 2007). Morgan Kaufmann Publishers, San Francisco, pp 1852–1859

  9. von Detten M, Heinzemann C, Platenius MC, Rieke J, Travkin D, Hildebrandt S (2012) Story diagrams–syntax and semantics. Technical Report tr-ri-12-324, Software Engineering Group, Heinz Nixdorf Institute, University of Paderborn

  10. Eckardt T, Heinzemann C, Henkler S, Hirsch M, Priesterjahn C, Schäfer W (2013) Modeling and verifying dynamic communication structures based on graph transformations. Comput Sci Res Dev 28(1):3–22

    Article  Google Scholar 

  11. Edelkamp S, Rensink A (2007) Graph transformation and ai planning. In: 2nd international competition on knowledge engineering for planning and scheduling (ICKEPS 2007)

  12. Ehrig H, Heckel R, Korff M, Löwe M, Ribeiro L, Wagner A, Corradini A (1997) Algebraic approaches to graph transformation II: single pushout approach and comparison with double pushout approach. In: Rozenberg G (ed) Handbook of graph grammars and computing by graph transformation. Foundations, vol 1, Chap 4, pp 247–312. World Scientific Publishing, Singapore

  13. Estler HC, Wehrheim H (2011) Heuristic search-based planning for graph transformation systems. In: ICAPS workshop on knowledge engineering for planning and scheduling (KEPS 2011), pp 54–61

  14. Fischer T, Niere J, Torunski L, Zündorf A (2000) Story diagrams: a new graph rewrite language based on the Unified Modeling Language and Java. In: Ehrig H, Engels G, Kreowski HJ, Rozenberg G (eds) 6th international workshop on theory and application of graph transformations (TAGT 1998). Lecture notes in computer science (LNCS), vol 1764. Springer, Berlin, pp 296–309

  15. Fox M, Long D (2003) PDDL2.1: an extension to PDDL for expressing temporal planning domains. J Artif Intell Res 20:61–124

    Google Scholar 

  16. Georgiadis I, Magee J, Kramer J (2002) Self-organising software architectures for distributed systems. In: Workshop on self-healing systems (WOSS 2002), pp 33–38

  17. Heinzemann C, Henkler S (2011) Timed story driven modeling. Technical Report tr-ri-11-326, Software Engineering Group, Heinz Nixdorf Institute, University of Paderborn

  18. Hoffmann J, Weber I, Kraft FM (2012) SAP speaks PDDL: exploiting a software-engineering model for planning in business process management. J Artif Intell Res 44(1):587–632

    MATH  Google Scholar 

  19. Kramer J, Magee J (2007) Self-managed systems: an architectural challenge. In: Workshop on the future of software engineering (FOSE 2007). IEEE Computer Society, Washington, DC, pp 259–268

  20. Le Métayer D (1998) Describing software architecture styles using graph grammars. IEEE Trans Softw Eng 24(7):521–533

    Article  Google Scholar 

  21. Lückel J, Hestermeyer T, Liu-Henke X (2001) Generalization of the cascade principle in view of a structured form of mechatronic systems. In: IEEE/ASME international conference on advanced intelligent mechatronics (AIM 2001), pp 123–128

  22. Meijer R (2012) PDDL planning problems and GROOVE graph transformations: combining two worlds with a translator. In: 17th Twente student conference on IT. University of Twente

  23. Object Management Group (OMG) (2009) Unified Modeling Language (UML) superstructure specification—version 2.2. Technical Report formal/2009-02-02, Object Management Group Inc.

  24. Object Management Group (OMG) (2011) Meta object facility (MOF) 2.0 query/view/transformation specification—version 1.1. Technical Report formal/2011-01-01, Object Management Group Inc.

  25. Plump D, Steinert S (2010) The semantics of graph programs. In: Mackie I, Moreira AM (eds) 10th international workshop on rule-based programming (RULE 2009), electronic proceedings in theoretical computer science (EPTCS), vol 21, pp 27–38

  26. Röhs M, Wehrheim H (2010) Sichere Konfigurationsplanung selbst-adaptierender Systeme durch Model Checking. In: Gausemeier J, Rammig F, Schäfer W, Trächtler A (eds) 9. Paderborner Workshop Entwurf mechatronischer Systeme, HNI-Verlagsschriftenreihe, vol 272, pp 253–265. Heinz Nixdorf Institut

  27. Simpson RM, Kitchin DE, McCluskey TL (2007) Planning domain definition using GIPO. Knowl Eng Rev 22(2):117–134

    Article  Google Scholar 

  28. Steenken D, Wehrheim H, Wonisch D (2011) Sound and complete abstract graph transformation. In: 14th Brazilian symposium on formal methods (SBMF 2011), pp 92–107

  29. Tichy M, Henkler S, Holtmann J, Oberthür S (2008) Component story diagrams: a transformation language for component structures in mechatronic systems. In: 4th workshop on object-oriented modeling of embedded real-time systems (OMER 4), pp 27–38

  30. Tichy M, Klöpper B (2011) Planning self-adaptation with graph transformations. In: Schürr A, Varró D, Varró G (eds) International symposium on applications of graph transformation with industrial relevance (AGTIVE 2011). Lecture notes in computer science (LNCS), vol 7233. Springer, Berlin

  31. Vaquero TS, Silva JR, Ferreira M, Tonidandel F, Beck JC (2009) From requirements and analysis to PDDL in itSIMPLE3.0. In: 19th international conference on automated planning and scheduling (ICAPS 2009)

  32. Vaquero TS, Tonaco R, Costa C, Tonidandel F, Silva JR, Beck JC (2012) itSIMPLE4.0: enhancing the modeling experience of planning problems. In: ICAPS 2012 system demonstrations, pp 11–14

  33. Vidal V (2011) YAHSP2: keep it simple, stupid. In: 7th international planning competition (IPC 2011), pp 83–90

  34. Wermelinger M, Fiadeiro JL (2002) A graph transformation approach to software architecture reconfiguration. Sci Comput Program 44(2):133–155

    Article  MATH  Google Scholar 

  35. Ziegert S, Heinzemann C, (2013) Durative graph transformation rules for modelling real-time reconfiguration. In: 10th international colloquium on theoretical aspects of computing (ICTAC, (2013) Lecture notes in computer science (LNCS), vol 8049. Springer, Berlin

  36. Ziegert S, Wehrheim H (2013) Temporal reconfiguration plans for self-adaptive systems. In: Kowalewski S, Rumpe B (eds) Software engineering (SE 2013). Lecture notes in informatics (LNI). Gesellschaft für Informatik e.V. (GI), Bonn

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Steffen Ziegert.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ziegert, S., Wehrheim, H. Temporal plans for software architecture reconfiguration. Comput Sci Res Dev 30, 303–320 (2015). https://doi.org/10.1007/s00450-014-0259-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00450-014-0259-7

Keywords

Navigation