References

1. Paolo Baldan, Andrea Corradini & Barbara König (2008): A framework for the verification of infinite-state graph transformation systems. Inf. Comput. 206(7), pp. 869–907, doi:10.1016/j.ic.2008.04.002.
2. Paolo Baldan, Andrea Corradini & Ugo Montanari (1998): Unfolding of Double-Pushout Graph Grammars is a Coreflection. In: TAGT, LNCS 1764. Springer, pp. 145–163, doi:10.1007/978-3-540-46464-8_11.
3. Paolo Baldan, Andrea Corradini, Ugo Montanari & Leila Ribeiro (2007): Unfolding semantics of graph transformation. Inf. Comput. 205(5), pp. 733–782, doi:10.1016/j.ic.2006.11.004.
4. Enrico Biermann, Hartmut Ehrig, Claudia Ermel, Ulrike Golas & Gabriele Taentzer (2010): Parallel independence of amalgamated graph transformations applied to model transformation. In: Graph transformations and model-driven engineering. Springer, pp. 121–140, doi:10.1007/978-3-642-17322-6_7.
5. Andrea Corradini, Maryam Ghaffari Saadat & Reiko Heckel (2019): Unfolding Graph Grammars with Negative Application Conditions. In: ICGT. Springer, pp. 93–110, doi:10.1007/978-3-030-23611-3_6.
6. Andrea Corradini & Reiko Heckel (2014): Canonical Derivations with Negative Application Conditions. In: ICGT, LNCS 8571. Springer, pp. 207–221, doi:10.1007/978-3-319-09108-2_14.
7. Andrea Corradini, Reiko Heckel, Frank Hermann, Susann Gottmann & Nico Nachtigall (2012): Transformation systems with incremental negative application conditions. In: International Workshop on Algebraic Development Techniques. Springer, pp. 127–142, doi:10.1007/978-3-642-37635-1_8.
8. Andrea Corradini, Ugo Montanari & Francesca Rossi (1996): Graph processes. Fundamenta Informaticae 26(3, 4), pp. 241–265, doi:10.3233/FI-1996-263402.
9. Andrea Corradini, Ugo Montanari, Francesca Rossi, Hartmut Ehrig, Reiko Heckel & Michael Löwe (1997): Algebraic approaches to graph transformation–part i: Basic concepts and double pushout approach. In: Handbook Of Graph Grammars And Computing By Graph Transformation: Volume 1: Foundations. World Scientific, pp. 163–245, doi:10.1142/3303.
10. Simone André da Costa Cavalheiro, Luciana Foss & Leila Ribeiro (2017): Theorem proving graph grammars with attributes and negative application conditions. TCS 686, pp. 25–77, doi:10.1016/j.tcs.2017.04.010.
11. Hartmut Ehrig, Michael Pfender & Hans Jürgen Schneider (1973): Graph-Grammars: An Algebraic Approach. In: 14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, October 15-17, 1973. IEEE Computer Society, pp. 167–180, doi:10.1109/SWAT.1973.11.
12. Hartmut Ehrig, Karsten Ehrig ande Ulrike Prange & Gabriele Taentzer (2006): Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. An EATCS Series. Springer, doi:10.1007/3-540-31188-2.
13. Maryam Ghaffari Saadat, Reiko Heckel & Fernando Orejas (2020): Unfolding Symbolic Attributed Graph Grammars. In: ICGT, LNCS 12150. Springer, pp. 75–90, doi:10.1007/978-3-030-51372-6_5.
14. Annegret Habel, Reiko Heckel & Gabriele Taentzer (1996): Graph Grammars with Negative Application Conditions. Fundam. Inform. 26(3/4), pp. 287–313, doi:10.3233/FI-1996-263404.
15. Annegret Habel & Karl-Heinz Pennemann (2009): Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19(2), pp. 245–296, doi:10.1017/S0960129508007202.
16. Reiko Heckel & Gabriele Taentzer (2020): Graph Transformation for Software Engineers: With Applications to Model-Based Development and Domain-Specific Language Engineering 1. Springer International Publishing, doi:10.1007/978-3-030-43916-3.
17. Manuel Koch & Francesco Parisi-Presicce (2002): Describing policies with graph constraints and rules. In: International Conference on Graph Transformation. Springer, pp. 223–238, doi:10.1007/3-540-45832-8_18.
18. Stephen Lack & PawełSobociński (2004): Adhesive categories. In: FOSSACS. Springer, pp. 273–288, doi:10.1007/978-3-540-24727-2_20.
19. Leen Lambers (2009): Certifying rule-based models using graph transformation.. Berlin Institute of Technology.
20. Nebras Nassar, Jens Kosiol, Thorsten Arendt & Gabriele Taentzer (2020): Constructing optimized constraint-preserving application conditions for model transformation rules. J. Log. Algebraic Methods Program. 114, doi:10.1016/j.jlamp.2020.100564.
21. Fernando Orejas & Leen Lambers (2010): Symbolic Attributed Graphs for Attributed Graph Transformation. ECEASST 30, doi:10.14279/tuj.eceasst.30.405.
22. Bruno Pinaud, Guy Melançon & Jonathan Dubois (2012): PORGY: a visual graph rewriting environment for complex systems. In: Computer Graphics Forum 31. Wiley Online Library, pp. 1265–1274, doi:10.1111/j.1467-8659.2012.03119.x.
23. Grzegorz Rozenberg (1986): Behaviour of Elementary Net Systems. In: ACPN, LNCS 254. Springer, pp. 60–94, doi:10.1007/BFb0046836.
24. Fabian Vogelsteller & Vitalik Buterin (2015): ERC-20 Token Standard: A standard interface for tokens. Available at https://github.com/ethereum/EIPs/blob/master/EIPS/eip-20.md.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org