References

  1. T. Boy de la Tour & R. Echahed (2020): Parallel Rewriting of Attributed Graphs. Theoretical Computer Science 848, pp. 106–132, doi:10.1016/j.tcs.2020.09.025.
  2. T. Boy de la Tour & R. Echahed (2021): Parallel Coherent Graph Transformations. In: Recent Trends in Algebraic Development Techniques, 25th International Workshop, WADT 2020, Revised Selected Papers, LNCS 12669. Springer, pp. 75–97, doi:10.1007/978-3-030-73785-6_5.
  3. Thierry Boy de la Tour (2023): Algebraic Monograph Transformations, doi:10.48550/ARXIV.2303.01137.
  4. Andrea Corradini, Dominique Duval, Rachid Echahed, Frédéric Prost & Leila Ribeiro (2019): The PBPO graph transformation approach. J. Log. Algebr. Meth. Program. 103, pp. 213–231, doi:10.1016/j.jlamp.2018.12.003.
  5. Andrea Corradini, Tobias Heindel, Frank Hermann & Barbara König (2006): Sesqui-Pushout Rewriting. In: ICGT 2006, LNCS 4178. Springer, pp. 30–45, doi:10.1007/11841883_4.
  6. Andrea Corradini, Ugo Montanari, Francesca Rossi, Hartmut Ehrig, Reiko Heckel & Michael Löwe (1997): Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach. In: Grzegorz Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientific, pp. 163–246, doi:10.1142/9789812384720_0003.
  7. Hartmut Ehrig (1979): Introduction to the algebraic theory of graph grammars (a survey). In: Volker Claus, Hartmut Ehrig & Grzegorz Rozenberg: Graph-Grammars and Their Application to Computer Science and Biology. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 1–69, doi:10.1007/BFb0025714.
  8. Hartmut Ehrig, Karsten Ehrig, Ulrike Prange & Gabriele Taentzer (2006): Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. An EATCS Series. Springer, doi:10.1007/3-540-31188-2.
  9. Alexandre Fernandez, Luidnel Maignan & Antoine Spicher (2021): Cellular Automata and Kan Extensions. In: Alonso Castillo-Ramirez, Pierre Guillon & Kévin Perrot: 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2021, OASIcs 90. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 7:1–7:12, doi:10.4230/OASIcs.AUTOMATA.2021.7.
  10. Alexandre Fernandez, Luidnel Maignan & Antoine Spicher (2022): Non-Determinism in Lindenmayer Systems and Global Transformations. In: Stefan Szeider, Robert Ganian & Alexandra Silva: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, LIPIcs 241. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 49:1–49:13, doi:10.4230/LIPIcs.MFCS.2022.49.
  11. Stephen Lack & Pawel Sobocinski (2005): Adhesive and quasiadhesive categories. Informatique Théorique et Applications 39(3), pp. 511–545, doi:10.1051/ita:2005028.
  12. F. W. Lawvere (1963): Functorial Semantics of Algebraic Theories. Columbia University, doi:10.1073/pnas.50.5.869. Available at http://www.tac.mta.ca/tac/reprints/articles/5/tr5abs.html.
  13. Michael Löwe (1993): Algebraic Approach to Single-Pushout Graph Transformation. Theoretical Computer Science 109, pp. 181–224, doi:10.1016/0304-3975(93)90068-5.
  14. Michael Löwe (2015): Polymorphic Sesqui-Pushout Graph Rewriting. In: Francesco Parisi-Presicce & Bernhard Westfechtel: Graph Transformation - 8th International Conference, ICGT 2015, Lecture Notes in Computer Science 9151. Springer, pp. 3–18, doi:10.1007/978-3-319-21145-9_1.
  15. Saunders Mac Lane (1997): Categories for the Working Mathematician, 2nd edition, Graduate Texts in Mathematics 5. Springer-Verlag, New York, doi:10.1007/978-1-4757-4721-8. (1st ed., 1971).
  16. Luidnel Maignan & Antoine Spicher (2015): Global Graph Transformations. In: Detlef Plump: Proceedings of the 6th International Workshop on Graph Computation Models, CEUR Workshop Proceedings 1403. CEUR-WS.org, pp. 34–49. Available at http://ceur-ws.org/Vol-1403/paper4.pdf.
  17. Peter Selinger (1997): Functionality, Polymorphism, and Concurrency: a Mathematical Investigation of Programming Paradigms. University of Pennsylvania. Technical Report No. IRCS-97-17.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org