H. J. S. Bruggink, B. König, D. Nolte & H. Zantema (2015):
Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings.
In: Proc. Conf. on Graph Transformation (ICGT),
LNCS 9151.
Springer,
pp. 52–68,
doi:10.1007/978-3-319-21145-9_4.
A. Corradini, D. Duval, R. Echahed, F. Prost & L. Ribeiro (2015):
AGREE – Algebraic Graph Rewriting with Controlled Embedding.
In: Proc. Conf. on Graph Transformation (ICGT),
LNCS 9151.
Springer,
pp. 35–51,
doi:10.1007/978-3-319-21145-9_3.
A. Corradini, D. Duval, R. Echahed, F. Prost & L. Ribeiro (2019):
The PBPO Graph Transformation Approach.
J. Log. Algebraic Methods Program. 103,
pp. 213–231,
doi:10.1016/j.jlamp.2018.12.003.
A. Corradini, T. Heindel, F. Hermann & B. König (2006):
Sesqui-Pushout Rewriting.
In: Proc. Conf. on Graph Transformation (ICGT),
LNCS 4178.
Springer,
pp. 30–45,
doi:10.1007/11841883_4.
N. Dershowitz & J.-P. Jouannaud (2018):
Graph Path Orderings.
In: Proc. Conf. on Logic for Programming, Artificial Intelligence and Reasoning, (LPAR),
EPiC Series in Computing 57.
EasyChair,
pp. 307–325,
doi:10.29007/6hkk.
H. Ehrig, K. Ehrig, U. Prange & G. Taentzer (2006):
Fundamentals of Algebraic Graph Transformation.
Springer,
doi:10.1007/3-540-31188-2_1.
H. Ehrig, M. Pfender & H. J. Schneider (1973):
Graph-Grammars: An Algebraic Approach.
In: Proc. Symp. on on Switching and Automata Theory (SWAT).
IEEE Computer Society,
pp. 167180,
doi:10.1109/SWAT.1973.11.
J. Endrullis, R.C. de Vrijer & J. Waldmann (2009):
Local Termination.
In: Proc. Conf. on Rewriting Techniques and Applications (RTA 2009),
LNCS 5595.
Springer,
pp. 270–284,
doi:10.1007/978-3-642-02348-4_19.
J. Endrullis, R.C. de Vrijer & J. Waldmann (2010):
Local Termination: Theory and Practice.
Logical Methods in Computer Science 6(3),
doi:10.2168/LMCS-6(3:20)2010.
J. Endrullis & H. Zantema (2015):
Proving Non-termination by Finite Automata.
In: Proc. Conf. on Rewriting Techniques and Applications (RTA 2015),
LIPIcs 36.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 160–176,
doi:10.4230/LIPIcs.RTA.2015.160.
S. Lack & P. Sobociński (2004):
Adhesive Categories.
In: Proc. Conf. on Foundations of Software Science and Computation Structures (FOSSACS),
LNCS 2987.
Springer,
pp. 273–288,
doi:10.1007/978-3-540-24727-2_20.
M. Löwe (1993):
Algebraic Approach to Single-Pushout Graph Transformation.
Theor. Comput. Sci. 109(1&2),
pp. 181–224,
doi:10.1016/0304-3975(93)90068-5.
S. Mac Lane (1971):
Categories for the Working Mathematician 5.
Springer Science & Business Media,
doi:10.1007/978-1-4612-9839-7.
R. Overbeek & J. Endrullis (2020):
Patch Graph Rewriting.
In: Proc. Conf. on Graph Transformation (ICGT),
LNCS 12150.
Springer,
pp. 128–145,
doi:10.1007/978-3-030-51372-6_8.
R. Overbeek, J. Endrullis & A. Rosset (2021):
Graph Rewriting and Relabeling with PBPO^+.
In: Proc. Conf. on Graph Transformation (ICGT),
LNCS 12741.
Springer,
pp. 60–80,
doi:10.1007/978-3-030-78946-6_4.
Terese (2003):
Term Rewriting Systems.
Cambridge Tracts in Theoretical Computer Science 55.
Cambridge University Press.