References

1. Beniamino Accattoli (2015): Proof nets and the call-by-value λ-calculus. Theor. Comput. Sci. 606, pp. 2–24, doi:10.1016/j.tcs.2015.08.006.
2. Sandra Alves, Maribel Fernández & Ian Mackie (2011): A new graphical calculus of proofs. In: Proceedings 6th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2011, Saarbrücken, Germany, 2nd April 2011., pp. 69–84, doi:10.4204/EPTCS.48.8.
3. Kartik Anand, Alan Kirman & Matteo Marsili (2013): Epidemics of rules, rational negligence and market crashes. The European Journal of Finance 19(5), pp. 438–447, doi:10.1080/1351847X.2011.601872.
4. Oana Andrei (2008): A Rewriting Calculus for Graphs: Applications to Biology and Autonomous Systems. (Un calcul de réécriture de graphes : applications à la biologie et aux systèmes autonomes). National Polytechnic Institute of Lorraine, Nancy, France.
5. Oana Andrei, Maribel Fernández, Hélène Kirchner, Guy Melançon, Olivier Namet & Bruno Pinaud (2011): PORGY: Strategy-Driven Interactive Transformation of Graphs. In: TERMGRAPH, pp. 54–68, doi:10.4204/EPTCS.48.7.
6. Oana Andrei & Hélène Kirchner (2008): A Rewriting Calculus for Multigraphs with Ports. Electr. Notes Theor. Comput. Sci. 219, pp. 67–82, doi:10.1016/j.entcs.2008.10.035.
7. Oana Andrei & Helene Kirchner (2009): A Higher-Order Graph Calculus for Autonomic Computing. In: Marina Lipshteyn, Vadim E. Levit & Ross M. McConnell: Graph Theory, Computational Intelligence and Thought. Springer-Verlag, Berlin, Heidelberg, pp. 15–26, doi:10.1007/978-3-642-02029-2_2.
8. Hendrik Pieter Barendregt (1990): Functional Programming and Lambda Calculus. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 321–363, doi:10.1016/B978-0-444-88074-1.50012-3.
9. Lars Birkedal, Troels Christoffer Damgaard, Arne J. Glenstrup & Robin Milner (2007): Matching of Bigraphs. Electr. Notes Theor. Comput. Sci. 175(4), pp. 3–19, doi:10.1016/j.entcs.2007.04.013.
10. Roberto Bruni, Ugo Montanari, Gordon D. Plotkin & Daniele Terreni (2014): On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs. Fundam. Inform. 134(3-4), pp. 287–317, doi:10.3233/FI-2014-1103.
11. Giorgio Busatto & Berthold Hoffmann (2001): Comparing Notions of Hierarchical Graph Transformation. Electr. Notes Theor. Comput. Sci. 50(3), pp. 310–317, doi:10.1016/S1571-0661(04)00184-7.
12. Giorgio Busatto, Hans-Jörg Kreowski & Sabine Kuske (2005): Abstract hierarchical graph transformation. Mathematical Structures in Computer Science 15(4), pp. 773–819, doi:10.1017/S0960129505004846.
13. Horatiu Cirstea & Claude Kirchner (2001): The rewriting calculus — Part I and II. Logic Journal of the Interest Group in Pure and Applied Logics 9(3), pp. 427–498, doi:10.1093/jigpal/9.3.339.
14. 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 Transformations, Volume 1: Foundations. World Scientific, pp. 163–246, doi:10.1142/9789812384720_0003. Available at http://www.worldscientific.com/doi/abs/10.1142/9789812384720_0003.
15. Vincent Danos, Feret, Walter Fontana, Russell Harmer, Jonathan Hayman, Jean Krivine, Chris Thompson-walsh & Glynn Winskel: Graphs, rewriting and causality in rule-based models, doi:http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.6822.
16. Frank Drewes, Berthold Hoffmann & Detlef Plump (2002): Hierarchical Graph Transformation. Journal of Computer and System Sciences 64(2), pp. 249 – 283, doi:10.1006/jcss.2001.1790.
17. Niels Van Eetvelde & Dirk Janssens (2003): A Hierarchical Program Representation for Refactoring. Electr. Notes Theor. Comput. Sci. 82(7), pp. 91–104, doi:10.1016/S1571-0661(04)80749-7.
18. Hartmut Ehrig, Reiko Heckel, Martin Korff, Michael Löwe, Leila Ribeiro, Annika Wagner & Andrea Corradini (1997): Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach. In: Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations, pp. 247–312, doi:10.1142/9789812384720_0004.
19. Nneka Ene, Maribel Fernández & Bruno Pinaud: Graph Models for Capital Markets, doi:https://nms.kcl.ac.uk/nneka.ene/papers.html. Available from https://nms.kcl.ac.uk/nneka.ene/papers.html.
20. Gregor Engels & Reiko Heckel (2000): Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution, pp. 127–150. Springer Berlin Heidelberg, Berlin, Heidelberg, doi:10.1007/3-540-45022-X_12.
21. Maribel Fernández, Hélène Kirchner & Bruno Pinaud (2017): Strategic Port Graph Rewriting: an Interactive Modelling Framework. Research Report. Inria ; LaBRI - Laboratoire Bordelais de Recherche en Informatique ; King's College London, doi:https://hal.inria.fr/hal-01251871. Available at https://hal.inria.fr/hal-01251871.
22. Maribel Fernández, Ian Mackie & Jorge Sousa Pinto (2007): A Higher-Order Calculus for Graph Transformation. Electr. Notes Theor. Comput. Sci. 72(1), pp. 45–58, doi:10.1016/j.entcs.2002.09.005.
23. Maribel Fernández & Sébastien Maulat (2012): Higher-order port-graph rewriting. In: Proceedings 2nd International Workshop on Linearity, LINEARITY 2012, Tallinn, Estonia, 1 April 2012., pp. 25–37, doi:10.4204/EPTCS.101.3.
24. Herman Geuvers & Iris Loeb (2007): Natural deduction via graphs: formal definition and computation rules. Mathematical Structures in Computer Science 17(3), pp. 485–526, doi:10.1017/S0960129507006123.
25. Georges Gonthier, Martín Abadi & Jean-Jacques Lévy (1992): The Geometry of Optimal Lambda Reduction. In: Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Albuquerque, New Mexico, USA, January 19-22, 1992, pp. 15–26, doi:10.1145/143165.143172.
26. Gary Gorton & Andrew Metrick (2012): Securitization. Working Paper 18611. National Bureau of Economic Research, doi:http://www.nber.org/papers/w18611. Available at http://www.nber.org/papers/w18611.
27. Annegret Habel, Jürgen Müller & Detlef Plump (2001): Double-pushout graph transformation revisited. Mathematical Structures in Computer Science 11(5), pp. 637–688, doi:10.1017/S0960129501003425.
28. Martin Junghanns, André Petermann & Erhard Rahm (2017): Distributed Grouping of Property Graphs with Gradoop. In: Proc. Datenbanksysteme für Business, Technologie und Web (BTW), pp. 103–122.
29. Yves Lafont (1990): Interaction Nets. In: Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, San Francisco, California, USA, January 1990, pp. 95–108, doi:10.1145/96709.96718.
30. Michael Löwe (1993): Algebraic approach to single-pushout graph transformation. Theoretical Computer Science 109, pp. 181–224, doi:10.1016/0304-3975(93)90068-5.
31. Michael Löwe, Martin Korff & Annika Wagner (1993): An Algebraic Framework for the Transformation of Attributed Graphs. In: M. R. Sleep, M. J. Plasmeijer & M. C. J. D. van Eekelen: Term Graph Rewriting. John Wiley and Sons Ltd., Chichester, UK, pp. 185–199.
32. Sheri Markose (2013): Systemic risk analytics: A data-driven multi-agent financial network (MAFN) approach. Journal of Banking Regulation 14(3-4), pp. 285–305, doi:10.1057/jbr.2013.10.
33. Sheri Markose, Yang Dong & Bewaji Oluwasegun (2008): An Multi-Agent Model of RMBS, Credit Risk Transfer in Banks and Financial Stability: Implications of the Subprime Crisis, doi:http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.509.3202&rep=rep1&type=pdf.
34. Sheri M. Markose, Bewaji Oluwasegun & Simone Giansante (2014): Multi-agent financial network (MAFN) model of US collateralized debt obligations (CDO):regulatory capital arbitrage, negative CDS carry trade, and systemic risk analysis. In: Banking, Finance, and Accounting. IGI Global, Hershey, U. S. A., pp. 561–590, doi:10.4018/978-1-4666-6268-1.ch030.
35. O. Mason & M. Verwoerd: Graph Theory and Networks in Biology. IET Systems Biology 1(2), pp. 89–119, doi:10.1049/iet-syb:20060038.
36. Robin Milner (2001): Bigraphical reactive systems: basic theory. Technical Report UCAM-CL-TR-523. University of Cambridge, Computer Laboratory.
37. Robin Milner (2006): Pure bigraphs: Structure and dynamics. Inf. Comput. 204(1), pp. 60–122, doi:10.1016/j.ic.2005.07.003.
38. Julia Padberg (2017): Hierarchical Graph Transformation Revisited - Transformations of Coalgebraic Graphs. In: Graph Transformation - 10th International Conference, ICGT 2017, Held as Part of STAF 2017, Marburg, Germany, July 18-19, 2017, Proceedings, pp. 20–35, doi:10.1007/978-3-319-61470-0_2.
39. Wojciech Palacz (2004): Algebraic hierarchical graph transformation. J. Comput. Syst. Sci. 68(3), pp. 497–520, doi:10.1016/S0022-0000(03)00064-3.
40. Detlef Plump (1998): Term Graph Rewriting. In: Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski & Grzegorz Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformations, Volume 2: Applications, Languages, and Tools. World Scientific, pp. 3–61, doi:10.1142/9789812815149_0001. Available at http://www.worldscientific.com/doi/abs/10.1142/9789812815149_0001.
41. H.J. Schneider (1993): On categorical graph grammars integrating structural transformations and operations on labels. Theoretical Computer Science 109(1), pp. 257 – 274, doi:10.1016/0304-3975(93)90070-A.
42. Arash ShabanNejad & Volker Haarslev (2015): Managing changes in distributed biomedical ontologies using hierarchical distributed graph transformation. International Journal of Data Mining and Bioinformatics 11(1), pp. 53–83, doi:10.1504/IJDMB.2015.066334.
43. Adam M. Smith, Wen Xu, Yao Sun, James R. Faeder & G.Elisabeta Marai (2012): RuleBender: integrated modeling, simulation and visualization for rule-based intracellular biochemistry. BMC Bioinformatics 13(8):S3, doi:10.1186/1471-2105-13-S8-S3.
44. Jason Vallet, Hélène Kirchner, Bruno Pinaud & Guy Melançon (2015): A Visual Analytics Approach to Compare Propagation Models in Social Networks. In: Proc. Graphs as Models, GaM 2015, pp. 65–79, doi:10.4204/EPTCS.181.5.
45. Grażyna \'Slusarczyk, Andrzej \IeCŁ achwa, Wojciech Palacz, Barbara Strug, Anna Paszyńska & Ewa Grabska (2017): An extended hierarchical graph-based building model for design and engineering problems. Automation in Construction 74, pp. 95 – 102, doi:10.1016/j.autcon.2016.11.008.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org