References

  1. Zena M. Ariola & Stefan Blom (1997): Cyclic Lambda Calculi. In: Martín Abadi & Takayasu Ito: Theoretical Aspects of Computer Software - TACS '97, LNCS 1281. Springer, pp. 77–106, doi:10.1007/BFb0014548.
  2. Zena M. Ariola & Jan Willem Klop (1996): Equational Term Graph Rewriting. Fundamenta Informaticae 26(3/4), pp. 207–240, doi:10.3233/FI-1996-263401.
  3. T. Boy de la Tour & R. Echahed (2020): Combining Parallel Graph Rewriting and Quotient Graphs. In: 13th International Workshop, WRLA 2020, LNCS 12328. Springer, pp. 1–18, doi:10.1007/978-3-030-63595-4_1.
  4. T. Boy de la Tour & R. Echahed (2020): Parallel Coherent Graph Transformations. In: Proceedings of WADT 2020, the 25th International Workshop on Algebraic Development Techniques, LNCS. Springer, to appear, see also CoRR (abs/1904.08850).
  5. 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.
  6. A. Corradini, D. Duval, M. Löwe, L. Ribeiro, R. Machado, A. Costa, G. Azzi, J. S. Bezerra & L. M. Rodrigues (2018): On the Essence of Parallel Independence for the Double-Pushout and Sesqui-Pushout Approaches. In: R. Heckel & G. Taentzer: Graph Transformation, Specifications, and Nets - In Memory of Hartmut Ehrig, LNCS 10800. Springer, pp. 1–18, doi:10.1007/978-3-319-75396-6_1.
  7. 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.
  8. A. Costa, J. Bezerra, G. Azzi, L. Rodrigues, T. R. Becker, R. G. Herdt & R. Machado (2016): Verigraph: A System for Specification and Analysis of Graph Grammars. In: L. Ribeiro & T. Lecomte: Formal Methods: Foundations and Applications SBMF 2016, LNCS 10090. Springer, pp. 78–94, doi:10.1007/978-3-319-49815-7_5.
  9. F. Drewes, H.-J. Kreowski & A. Habel (1997): Hyperedge Replacement Graph Grammars. In: G. Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientific, pp. 95–162, doi:10.1142/9789812384720_0002.
  10. Dominique Duval, Rachid Echahed, Frédéric Prost & Leila Ribeiro (2014): Transformation of Attributed Structures with Cloning. In: Stefania Gnesi & Arend Rensink: Fundamental Approaches to Software Engineering - FASE 2014, LNCS 8411. Springer, pp. 310–324, doi:10.1007/978-3-642-54804-8_22.
  11. 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.
  12. Hartmut Ehrig & Hans-Jörg Kreowski (1976): Parallelism of Manipulations in Multidimensional Information Structures. In: Mathematical Foundations of Computer Science, LNCS 45. Springer, pp. 284–293, doi:10.1007/3-540-07854-1_188.
  13. Ole Kniemeyer, Günter Barczik, Reinhard Hemmerling & Winfried Kurth (2007): Relational Growth Grammars - A Parallel Graph Transformation Approach with Applications in Biology and Architecture. In: Third International Symposium AGTIVE, Revised Selected and Invited Papers, pp. 152–167, doi:10.1007/978-3-540-89020-1_12.
  14. Leen Lambers, Hartmut Ehrig & Fernando Orejas (2008): Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs. Electron. Notes Theor. Comput. Sci 211, pp. 17–26, doi:10.1016/j.entcs.2008.04.026.
  15. Ivan Lanese & Ugo Montanari (2005): Synchronization Algebras with Mobility for Graph Transformations. Electr. Notes Theor. Comput. Sci 138(1), pp. 43–60, doi:10.1016/j.entcs.2005.05.004.
  16. D. Plump: Term Graph Rewriting. In: Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages and Tools, doi:10.1142/9789812815149_0001.
  17. Detlef Plump & Sandra Steinert (2004): Towards Graph Programs for Graph Algorithms. In: Second International Conference, ICGT 2004, LNCS 3256, pp. 128–143, doi:10.1007/978-3-540-30203-2_11.
  18. Barry K. Rosen (1975): A Church-Rosser Theorem for Graph Grammars. Sigact News 7(3), pp. 26–31, doi:10.1145/1008343.1008344.

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