L. Baresi & R. Heckel (2002):
Tutorial Introduction to Graph Transformation: A Software Engineering Perspective.
In: Proc. Conf. on Graph Transformation (ICGT),
LNCS 2505.
Springer,
pp. 402–429,
doi:10.1007/3-540-45832-8_30.
M. Barr & C. Wells (1990):
Category theory for computing science.
Prentice Hall.
M. Bauderon (1995):
A Uniform Approach to Graph Rewriting: The Pullback Approach.
In: Proc. of Graph-Theoretic Concepts in Computer Science,
LNCS 1017.
Springer,
pp. 101–115,
doi:10.1007/3-540-60618-1_69.
M. Bauderon & H. Jacquet (2001):
Pullback as a Generic Graph Rewriting Mechanism.
Appl. Categorical Struct. 9(1),
pp. 65–82,
doi:10.1023/A:1008610714027.
R. E. Bryant (1986):
Graph-Based Algorithms for Boolean Function Manipulation.
IEEE Trans. Computers 35(8),
pp. 677–691,
doi:10.1109/TC.1986.1676819.
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.
H. Ehrig (1986):
Tutorial introduction to the algebraic approach of graph grammars.
In: Proc. Workshop on Graph-Grammars and Their Application to Computer Science,
LNCS 291.
Springer,
pp. 3–14,
doi:10.1007/3-540-18771-5_40.
H. Ehrig, K. Ehrig, U. Prange & G. Taentzer (2006):
Fundamentals of Algebraic Graph Transformation.
Monographs in Theoretical Computer Science. An EATCS Series.
Springer,
doi:10.1007/3-540-31188-2.
H. Ehrig, M. Korff & M. Löwe (1990):
Tutorial Introduction to the Algebraic Approach of Graph Grammars Based on Double and Single Pushouts.
In: Proc. Workshop on Graph-Grammars and Their Application to Computer Science,
LNCS 532.
Springer,
pp. 24–37,
doi:10.1007/BFb0017375.
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. 167–180,
doi:10.1109/SWAT.1973.11.
A. Habel, J. Müller & D. Plump (2001):
Double-pushout graph transformation revisited.
Math. Struct. Comput. Sci. 11(5),
pp. 637–688,
doi:10.1017/S0960129501003425.
R. Heckel (2006):
Graph Transformation in a Nutshell.
Electron. Notes Theor. Comput. Sci. 148(1),
pp. 187–198,
doi:10.1016/j.entcs.2005.12.018.
M. Huth & M. Ryan (2004):
Logic in Computer Science: Modelling and Reasoning about Systems.
Cambridge University Press,
doi:10.1017/CBO9780511810275.
B. König, D. Nolte, J. Padberg & A. Rensink (2018):
A Tutorial on Graph Transformation.
In: Graph Transformation, Specifications, and Nets - In Memory of Hartmut Ehrig,
LNCS 10800.
Springer,
pp. 83–104,
doi:10.1007/978-3-319-75396-6_5.
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.
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.
R. Overbeek, J. Endrullis & A. Rosset (2022):
Graph Rewriting and Relabeling with PBPO^+: A Unifying Theory for Quasitoposes.
CoRR abs/2203.01032,
doi:10.48550/arXiv.2203.01032.
ArXiv:2203.01032.
eptcs@eptcs.org