1. Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson & Mayank Saksena (2004): A Survey of Regular Model Checking. In: Philippa Gardner & Nobuko Yoshida: CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings, Lecture Notes in Computer Science 3170. Springer, pp. 35–48, doi:10.1007/978-3-540-28644-8_3.
  2. Paolo Baldan, Andrea Corradini & Barbara König (2001): A Static Analysis Technique for Graph Transformation Systems. In: Proc. CONCUR'01, LNCS 2154. Springer, pp. 381–395, doi:10.1007/3-540-44685-0_26.
  3. Paolo Baldan, Andrea Corradini, Barbara König & Alberto Lluch-Lafuente (2006): A Temporal Graph Logic for Verification of Graph Transformation Systems. In: WADT, LNCS 4409. Springer, pp. 1–20, doi:10.1007/978-3-540-71998-4_1.
  4. Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier & Jan Stückrath (2012): On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. In: RTA, LIPIcs 15, doi:10.4230/LIPIcs.RTA.2012.101.
  5. Bruno Courcelle & Joost Engelfriet (2012): Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach 138. Cambridge University Press, doi:10.1017/CBO9780511977619.
  6. Frank Drewes, Hans-Jörg Kreowski & Annegret Habel (1997): Hyperedge Replacement Graph Grammars. In: Handbook of Graph Grammars. World Scientific, pp. 95–162.
  7. J. Engelfriet & G. Rozenberg (1997). In: Grzegorz Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformation, chapter Node Replacement Graph Grammars. World Scientific Publishing Co., Inc., pp. 1–94, doi:10.1142/9789812384720_0001.
  8. J. Esparza, P. Ganty & R. Majumdar (2012): A Perfect Model for Bounded Verification. In: LICS 2012. IEEE Computer Society, pp. 285–294, doi:10.1109/LICS.2012.39.
  9. J. Esparza, P. Ganty & T. Poch (2014): Pattern-Based Verification for Multithreaded Programs. ACM Trans. Program. Lang. Syst. 36(3), pp. 9:1–9:29, doi:10.1145/2629644.
  10. E.M. Gurari & O.H. Ibarra (1981): The Complexity of Decision Problems for Finite-Turn Multicounter Machines. J. Comput. Syst. Sci. 22(2), pp. 220–229, doi:10.1016/0022-0000(81)90028-3.
  11. E.M. Gurari & O.H. Ibarra (1982): Two-Way Counter Machines and Diophantine Equations. J. ACM 29(3), pp. 863–873, doi:10.1109/SFCS.1981.52.
  12. John E. Hopcroft & Jeffrey D. Ullman (2000): Introduction to Automata Theory, Languages and Computation, Second Edition. Addison-Wesley.
  13. Oscar H. Ibarra (1978): Reversal-Bounded Multicounter Machines and Their Decision Problems. J. ACM 25(1), pp. 116–133, doi:10.1145/322047.322058.
  14. Oscar H. Ibarra (2014): Automata with Reversal-Bounded Counters: A Survey. In: DCFS 2014. Springer, pp. 5–22, doi:10.1007/978-3-319-09704-6_2.
  15. Barbara König & Vitali Kozioura (2006): Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems. In: TACAS, LNCS 3920. Springer, pp. 197–211, doi:10.1007/11691372_13.
  16. P. Madhusudan & Gennaro Parlato (2011): The tree width of auxiliary storage. In: Thomas Ball & Mooly Sagiv: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, 2011. ACM, pp. 283–294, doi:10.1145/1926385.1926419.
  17. M. O. Rabin & D. Scott (1959): Finite Automata and Their Decision Problems. IBM Journal of Research and Development 3(2), pp. 114–125, doi:10.1147/rd.32.0114.
  18. Arend Rensink (2008): Explicit State Model Checking for Graph Grammars. In: Concurrency, Graphs and Models, LNCS 5065. Springer, pp. 114–132, doi:10.1007/978-3-540-68679-8_8.
  19. Arnold L. Rosenberg (1965): On multi-head finite automata. In: 6th Annual Symposium on Switching Circuit Theory and Logical Design. IEEE Computer Society, pp. 221–228, doi:10.1109/FOCS.1965.19.
  20. M.Y. Vardi (2014): From Löwenheim to PSL and SVA. In: Language, Culture, Computation. Computing - Theory and Technology - Essays Dedicated to Yaacov Choueka on the Occasion of His 75th Birthday, Part I, Lecture Notes in Computer Science 8001. Springer, pp. 78–102, doi:10.1007/978-3-642-45321-2_5.

Comments and questions to:
For website issues: