1. Abdulla, P.A., Čerāns, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proc. of LICS 1996, pp. 313–321. IEEE (1996)
2. Bertrand, N., Delzanno, G., König, B., Sangnier, A., Stückrath, J.: On the decidability status of reachability and coverability in graph transformation systems. In: Proc. of RTA 2012. LIPIcs. Schloss Dagstuhl – Leibniz Center for Informatics (2012)
3. Lecture Notes in Computer Science;A. Bouajjani,1999
4. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. Springer (2006)
5. Esparza, J., Nielsen, M.: Decidability issues for Petri nets. Technical Report RS-94-8, BRICS (May 1994)