Graph-Transformational Swarms with Stationary Members

  • Larbi AbdenebaouiEmail author
  • Hans-Jörg Kreowski
  • Sabine Kuske
Conference paper
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 450)


The concept of graph-transformational swarms is a novel approach that offers a rule-based framework to model discrete swarm methods. This paper continues the research on graph-transformational swarms by focusing on a special type of members called stationary members. The stationary members are assigned to particular subgraphs of the considered environment graphs. Every stationary member is responsible for calculations and transformations at the assigned area, and the applicability of the member’s rules depends only on this area and not on the whole environment. A further advantage of stationary members is that it is easier to guarantee that they can act in parallel than for moving members. Cloud computing is an engineering topic where swarms with stationary members can be applied in an adequate way, namely, by modeling the nodes of the server network that forms the cloud as stationary members. We illustrate the proposed concept by means of a case study.


Swarm computation Graph transformation Stationary members Cloud computing 


  1. 1.
    Abdenebaoui, L., Kreowski, H.-J., Kuske, S.: Graph-transformational swarms. In: Bensch, S., Drewes, F., Freund, R., Otto, F. (eds.) Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications – NCMA 2013, Umea, Sweden, August 13–August 14, pp. 35–50. Österreichische Computer Gesellschaft (2013)Google Scholar
  2. 2.
    Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006)Google Scholar
  3. 3.
    Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. John Wiley & Sons (2006)Google Scholar
  4. 4.
    Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Evolutionary Computation Series. Morgan Kaufman, San Francisco (2001)Google Scholar
  5. 5.
    Kreowski, H.-J.: Manipulationen von Graphmanipulationen. PhD thesis, Technische Universität Berlin (1977)Google Scholar
  6. 6.
    Kreowski, H.-J., Klempien-Hinrichs, R., Kuske, S.: Some essentials of graph transformation. In: Esik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. SCI, vol. 25, pp. 229–254. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Kreowski, H.-J., Kuske, S., Rozenberg, G.: Graph transformation units – an overview. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 57–75. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  8. 8.
    Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol. 1. World Scientific, Singapore (1997)Google Scholar
  9. 9.
    Ehrig, H., Kreowski, H.-J., Montanari, U., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation. Concurrency, Parallellism, and Distribution, vol. 3. World Scientific (1999)Google Scholar
  10. 10.
    Métivier, Y., Sopena, E.: Graph Relabelling Systems: A General Overview. Computers and Artificial Intelligence 16(2) (1997)Google Scholar
  11. 11.
    Bauderon, M., Métivier, Y., Mosbah, M., Sellami, A.: Graph Relabelling Systems: A Tool for Encoding, Proving, Studying and Visualizing Distributed Algorithms. Electronic Notes in Theoretical Computer Science 51, 93–107 (2002)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2015

Authors and Affiliations

  • Larbi Abdenebaoui
    • 1
    Email author
  • Hans-Jörg Kreowski
    • 1
  • Sabine Kuske
    • 1
  1. 1.University of BremenBremenGermany

Personalised recommendations