1. Larbi Abdenebaoui, Hans-Jörg Kreowski & Sabine Kuske (2015): Graph-Transformational Swarms with Stationary Members. In: DoCEIS 2015: Technological Innovation for Cloud-Based Engineering Systems, IFIP Advances in Information and Communication Technology 450, pp. 137–144, doi:10.1007/978-3-319-16766-4_15.
  2. Krzysztof R. Apt, Ernst-Rüdiger Olderog & Frank S. de Boer (2009): Verification of Sequential and Concurrent Programs, 3 edition, Texts in Computer Science. Springer, doi:10.1007/978-1-84882-745-5.
  3. Christel Baier & Joost-Pieter Katoen (2008): Principles of Model Checking. The MIT Press, doi:10.1093/comjnl/bxp025.
  4. Edmund M. Clarke & E. Allen Emerson (1982): Design and synthesis of synchronization skeletons using branching time temporal logic. In: Logics of Programs, Lecture Notes in Computer Science 131. Springer, pp. 52–71, doi:10.1007/BFb0025774.
  5. Andrea Corradini, Luciana Foss & Leila Ribeiro (2009): Graph Transformation with Dependencies for the Specification of Interactive Systems. In: Recent Trends in Algebraic Development Techniques: 19th International Workshop, WADT 2008, Lecture Notes in Computer Science 5486, pp. 102–118, doi:10.1007/978-3-642-03429-9_8.
  6. Giuseppe De Giacomo & Moshe Y. Vardi (2013): Linear Temporal Logic and Linear Dynamic Logic on Finite Traces. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI '13, pp. 854–860. Available at
  7. Hartmut Ehrig, Karsten Ehrig, Ulrike Prange & Gabriele Taentzer (2006): Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science XIV. Springer, doi:10.1007/3-540-31188-2.
  8. E. Allen Emerson (1990): Temporal and Modal Logic. In: Handbook of Theoretical Computer Science B. Elsevier, pp. 995–1072, doi:10.1016/B978-0-444-88074-1.50021-4.
  9. Nils Erik Flick (2016): Proving correctness of graph programs relative to recursively nested conditions. Department of Computing Science, University of Oldenburg. Available at
  10. Holger Giese, Maria Maximova, Lucas Sakizloglou & Sven Schneider (2019): Metric Temporal Graph Logic over Typed Attributed Graphs. In: Fundamental Approaches to Software Engineering, Lecture Notes in Computer Science 11424, pp. 282–298, doi:10.1007/978-3-030-16722-6_16.
  11. Annegret Habel & Karl-Heinz Pennemann (2009): Correctness of high-level transformation systems relative to nested conditions. Mathematical Structures in Computer Science 19. Cambridge University Press, pp. 245–296, doi:10.1017/S0960129508007202.
  12. Annegret Habel, Karl-Heinz Pennemann & Arend Rensink (2006): Weakest Preconditions for High-Level Programs. In: Graph Transformations (ICGT 2006), Lecture Notes in Computer Science 4178, pp. 445–460, doi:10.1007/11841883_31.
  13. Reiko Heckel, Georgios Lajios & Sebastian Menge (2004): Stochastic Graph Transformation Systems. In: Graph Transformations (ICGT 2004), Lecture Notes in Computer Science 3256, pp. 210–225, doi:10.1007/978-3-540-30203-2_16.
  14. Martin Hilscher & Maike Schwammberger (2016): An Abstract Model for Proving Safety of Autonomous Urban Traffic. In: Theoretical Aspects of Computing – ICTAC 2016, Lecture Notes in Computer Science 9965, pp. 274–292, doi:10.1007/978-3-319-46750-4_16.
  15. Karsten Hölscher, Hans-Jörg Kreowski & Sabine Kuske: Autonomous Units and Their Semantics – The Sequential Case. In: International Conference on Graph Transformation 2006, Lecture Notes in Computer Science 4178, pp. 245–259, doi:10.1007/11841883_18.
  16. Harmen Kastenberg & Arend Rensink (2006): Model Checking Dynamic States in GROOVE. In: Proceedings of the 13th International Conference on Model Checking Software (SPIN), Lecture Notes in Computer Science 3925, pp. 299–305, doi:10.1007/11691617_19.
  17. Barbara König & Jan Stückrath (2017): Well-structured graph transformation systems. In: Information and Computation 252, pp. 71–94, doi:10.1016/j.ic.2016.03.005.
  18. Christoph Peuser (2018): From Hyperedge Replacement Grammars to Decidable Hyperedge Replacement Games. In: Software Technologies: Applications and Foundations (STAF 2018), Lecture Notes in Computer Science 11176, pp. 463–478, doi:10.1007/978-3-030-04771-9_33.
  19. Christopher M. Poskitt & Detlef Plump (2013): Verifying Total Correctness of Graph Programs. In: Electronic Communications of the EASST 61, doi:10.14279/tuj.eceasst.61.827.
  20. Arend Rensink (2004): Representing First-Order Logic Using Graphs. In: Proceedings of the International Conference on Graph Transformation, Lecture Notes in Computer Science 3256. Springer, pp. 319–335, doi:10.1007/978-3-540-30203-2_23.
  21. Gabriele Taentzer, Manuel Koch, Ingrid Fischer & Victor Volle (1999): Distributed Graph Transformation with Application to Visual Design of Distributed Systems. Handbook of Graph Grammars and Computing by Graph Transformation. World Scientific Publisher, doi:10.1142/9789812814951_0005.
  22. Wolfgang Thomas (1990): Automata on infinite objects. In: Handbook of Theoretical Computer Science, Volume B, pp. 133–191, doi:10.1016/B978-0-444-88074-1.50009-3. Available at
  23. Zheng-guang Wang, Xiao-hui Liang & Qin-ping Zhao (2006): A Graph Transformation System Model of Dynamic Reorganization in Multi-agent Systems. In: Intelligent Data Engineering and Automated Learning – IDEAL 2006, Lecture Notes in Computer Science 4224, pp. 1182–1190, doi:10.1007/11875581_140.
  24. Nils Worzyk, Hendrik Kahlen & Oliver Kramer (2019): Physical Adversarial Attacks by Projecting Perturbations. In: Artificial Neural Networks and Machine Learning – ICANN 2019: Image Processing, Lecture Notes in Computer Science 11729, pp. 649–659, doi:10.1007/978-3-030-30508-6_51.

Comments and questions to:
For website issues: