F. Baader and W. Snyder, Unification theory, Handbook of Automated Reasoning, pp.445-532, 2001.

C. Bak, GP 2: Efficient Implementation of a Graph Programming Language, 2015.

R. J. Duffin, Topology of series-parallel networks, Journal of Mathematical Analysis and Applications, vol.10, issue.2, pp.303-31810, 1965.
DOI : 10.1016/0022-247X(65)90125-3

H. Ehrig, K. Ehrig, U. Prange, and G. Taentzer, Fundamentals of Algebraic Graph Transformation, Monographs in Theoretical Computer Science, 2006.

H. Ehrig, U. Golas, A. Habel, L. Lambers, and F. Orejas, M-adhesive transformation systems with nested application conditions: Part 2: Embedding, Critical Pairs and Local Confluence, Fundamenta Informaticae, vol.118, issue.1-2, pp.35-6310, 2012.

H. Ehrig, U. Prange, and G. Taentzer, Fundamental Theory for Typed Attributed Graph Transformation, Proc. International Conference on Graph Transformations, pp.161-177, 2004.
DOI : 10.1007/978-3-540-30203-2_13

U. Golas, L. Lambers, H. Ehrig, and F. Orejas, Attributed graph transformation with inheritance: Efficient conflict detection and local confluence analysis using abstract critical pairs, Theoretical Computer Science, vol.424, pp.46-68, 2012.
DOI : 10.1016/j.tcs.2012.01.032

A. Habel and D. Plump, Relabelling in Graph Transformation, Proc. International Conference on Graph Transformation, pp.135-147, 2002.
DOI : 10.1007/3-540-45832-8_12

URL : http://www-users.cs.york.ac.uk/~det/Papers/icgt.02.pdf

A. Habel and D. Plump, M, N -adhesive transformation systems, Proc. International Conference on Graph Transformation, pp.218-233, 2012.

R. Heckel, J. M. Küster, and G. Taentzer, Confluence of Typed Attributed Graph Transformation Systems
DOI : 10.1007/3-540-45832-8_14

URL : http://www.cs.tu-berlin.de/~gabi/gHKT02b.pdf

I. Hristakiev and D. Plump, A unification algorithm for GP 2 In: Graph Computation Models Revised Selected Papers, Electronic Communications of the EASST, vol.71, 2014.

I. Hristakiev and D. Plump, Attributed graph transformation via rule schemata: Church-Rosser theorem In: Graph Computation Models, part of Software Technologies: Applications and Foundations (STAF 2016), Revised Selected Papers, pp.145-160, 2014.

I. Hristakiev and D. Plump, Towards critical pair analysis for the graph programming language GP 2 (long version) (2017), https

G. Kulcsár, F. Deckwerth, M. Lochau, G. Varró, and A. Schürr, Improved Conflict Detection for Graph Transformation with Attributes, Proc. Graphs as Models, pp.97-112, 2015.
DOI : 10.1007/978-3-540-78800-3_24

D. Plump, Confluence of Graph Transformation Revisited, Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday, pp.280-30810, 2005.
DOI : 10.1007/11601548_16

D. Plump, The Design of GP 2, Proc. International Workshop on Reduction Strategies in Rewriting and Programming, pp.1-1610, 2011.
DOI : 10.4204/EPTCS.21.3