\begin{thebibliography}{10}

\bibitem{b:graphsprachen-inv}
C.~Blume.
\newblock Graphsprachen f\"ur die {S}pezifikation von {I}nvarianten bei
  verteilten und dynamischen {S}ystemen.
\newblock Master's thesis, Universit\"at Duisburg-Essen, Nov. 2008.

\bibitem{bbk:recognizable-invariants}
Christoph Blume, H.J.~Sander Bruggink, and Barbara K{\"o}nig.
\newblock Recognizable graph languages for checking invariants.
\newblock In {\em Proc. of GT-VMT '10 (Workshop on Graph Transformation and
  Visual Modeling Techniques)}, Electronic Communications of the EASST, 2010.

\bibitem{bjnt:regular-mc}
A.~Bouajjani, B.~Jonsson, M.~Nilsson, and T.~Touili.
\newblock Regular model checking.
\newblock In {\em Proc. of CAV '00}, pages 403--418. Springer, 2000.
\newblock {LNCS} 1855.

\bibitem{bk:recognizability}
S.~Bozapalidis and A.~Kalampakas.
\newblock Recognizability of graph and pattern languages.
\newblock {\em Acta Informatica}, 42(8/9):553--581, 2006.

\bibitem{bk:graph-automata}
S.~Bozapalidis and A.~Kalampakas.
\newblock Graph automata.
\newblock {\em Theoretical Computer Science}, 393:147--165, 2008.

\bibitem{bk:rec-arrow-graph}
H.J.S. Bruggink and B.~K{\"o}nig.
\newblock On the recognizability of arrow and graph languages.
\newblock In {\em Proc. of ICGT '08}, pages 336--350. Springer, 2008.
\newblock {LNCS} 5214.

\bibitem{c:mso-graphs-I}
B.~Courcelle.
\newblock The monadic second-order logic of graphs~{I}. {R}ecognizable sets of
  finite graphs.
\newblock {\em Information and Computation}, 85:12--75, 1990.

\bibitem{c:graph-mso}
B.~Courcelle.
\newblock The expression of graph properties and graph transformations in
  monadic second-order logic.
\newblock In G.~Rozenberg, editor, {\em Handbook of Graph Grammars and
  Computing by Graph Transformation, Vol.1: Foundations}, chapter~5. World
  Scientific, 1997.

\bibitem{cd:verifying-mso-tree-automata}
Bruno Courcelle and Ir\`ene Durand.
\newblock Verifying monadic second order graph properties with tree automata.
\newblock In {\em European Lisp Symposium}, May 2010.

\bibitem{ghw:match-bounded-srs}
A.~Geser, D.~Hofbauer, and J.~Waldmann.
\newblock Match-bounded string rewriting systems.
\newblock {\em Applicable Algebra in Engineering, Communication and Computing},
  15(3--4):149--171, 2004.

\bibitem{g:comp-rep-subsets}
G.~Griffing.
\newblock Composition-representative subsets.
\newblock {\em Theory and Applications of Categories}, 11(19):420--437, 2003.

\bibitem{g:logic-graphs-algorithms}
M.~Grohe.
\newblock Logic, graphs and algorithms.
\newblock In J.Flum, E.Gr\"adel, and T.Wilke, editors, {\em Logic and Automata
  -- History and Perspectives}. Amsterdam University Press, 2007.

\bibitem{h:thesis}
T.~Heindel.
\newblock {\em A category theoretical approach to the concurrent semantics of
  rewriting}.
\newblock PhD thesis, Universit\"at Duisburg--Essen, September 2009.
\newblock \url{http://www.ti.inf.uni-due.de/people/heindel/diss.pdf}.

\bibitem{j:categorical-logic-type-theory}
Bart Jacobs.
\newblock {\em Categorical Logic and Type Theory}, volume 141 of {\em Studies
  in Logic and the Foundation of Mathematics}.
\newblock Elsevier, 1999.

\bibitem{ls:adhesive-journal}
S.~Lack and P.~Soboci\'{n}ski.
\newblock Adhesive and quasiadhesive categories.
\newblock {\em RAIRO -- Theoretical Informatics and Applications}, 39(3), 2005.

\bibitem{p:categorical-logic}
A.M. Pitts.
\newblock Categorical logic.
\newblock In S.~Abramsky, D.~M. Gabbay, and T.~S.~E. Maibaum, editors, {\em
  Handbook of Logic in Computer Science {V}}. Oxford University Press, 2001.

\bibitem{r:representing-fol}
A.~Rensink.
\newblock Representing first-order logic using graphs.
\newblock In {\em Proc. of ICGT '04}, pages 319--335. Springer, 2004.
\newblock {LNCS} 3256.

\end{thebibliography}
