1. Lecture Notes in Computer Science;T Arendt,2014
2. Abdulla, P.A., Jonsson, B.: Ensuring completeness of symbolic verification methods for infinite-state systems. Theor. Comput. Sci. 256(1–2), 145–167 (2001)
3. 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: Rewriting Techniques and Applications (RTA 2012). LIPIcs, vol. 15, pp. 101–116 (2012)
4. Becker, J.S.: An automata-theoretic approach to instance generation. In: Graph Computation Models (GCM 2016), Electronic Pre-Proceedings (2016)
5. Lecture Notes in Computer Science;G Bergmann,2014