References

  1. Oana Andrei (2008): A Rewriting Calculus for Graphs: Applications to Biology and Autonomous Systems. Institut National Polytechnique de Lorraine. Available at http://tel.archives-ouvertes.fr/tel-00337558/fr/.
  2. Oana Andrei & Muffy Calder (2010): A Model and Analysis of the AKAP Scaffold. In: Proc. of CS2Bio'10, To appear in Electronic Notes in Theoretical Computer Science.
  3. Oana Andrei, Liliana Ibanescu & Hélène Kirchner (2006): Non-intrusive Formal Methods and Strategic Rewriting for a Chemical Application.. In: Kokichi Futatsugi, Jean-Pierre Jouannaud & José Meseguer: Algebra, Meaning, and Computation, Lecture Notes in Computer Science 4060. Springer, pp. 194–215.
  4. Oana Andrei & Hélène Kirchner (2009): A Higher-Order Graph Calculus for Autonomic Computing. In: M. Lipshteyn, V.E. Levit & R.M. McConnell: Graph Theory, Computational Intelligence and Thought, Lecture Notes in Computer Science 5420. Springer, pp. 15–26.
  5. Oana Andrei & Hélène Kirchner (2009): A Port Graph Calculus for Autonomic Computing and Invariant Verification. In: Proceedings of the Fifth International Workshop on Computing with Terms and Graphs (TERMGRAPH 2009), Electronic Notes in Theoretical Computer Science 253, pp. 17–38.
  6. David Auber (2003): Tulip – A huge graph visualization framework. In: P. Mutzel & M. Jünger: Graph Drawing Software, Mathematics and Visualization Series. Springer Verlag, pp. 105–126.
  7. Daniel Balasubramanian, Anantha Narayanan, Christopher P. van Buskirk & Gabor Karsai (2006): The Graph Rewriting and Transformation Language: GReAT. ECEASST 1.
  8. Olivier Bournez, Guy-Marie C^ome, Valérie Conraud, Hélène Kirchner & Liliana Ibanescu (2003): A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms.. In: Robert Nieuwenhuis: RTA, Lecture Notes in Computer Science 2706. Springer, pp. 30–45.
  9. L. P. Cordella, P. Foggia, C. Sansone & M. Vento (2004): A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs. IEEE Trans. on Pattern Analysis and Machine Intelligence 26(10), pp. 1367–1372.
  10. Bruno Courcelle (1990): Graph Rewriting: An Algebraic and Logic Approach. In: J. van Leeuwen: Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics. Elsevier Science Publishers and MIT Press, pp. 193–242.
  11. Vincent Danos & Cosimo Laneve (2004): Formal Molecular Biology.. Theoretical Computer Science 325(1), pp. 69–110.
  12. Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski & Grzegorz Rozenberg (1997): Handbook of Graph Grammars and Computing by Graph Transformations, Volume 2: Applications, Languages, and Tools. World Scientific.
  13. Hartmut Ehrig, Hans-Jörg Kreowski, Ugo Montanari & Grzegorz Rozenberg (1997): Handbook of Graph Grammars and Computing by Graph Transformations, Volume 3: Concurrency, Parallelism, and Distribution. World Scientific.
  14. Claudia Ermel, Michael Rudolf & Gabriele Taentzer (1997): The AGG Approach: Language and Environment. In: 1997handbook2. World Scientific, pp. 551–603.
  15. James R. Faeder, Michael L. Blinov & William S. Hlavacek (2009): Rule-Based Modeling of Biochemical Systems with BioNetGen. In: Ivan V. Maly: Systems Biology, Methods in Molecular Biology. Humana Press, pp. 133–168.
  16. Maribel Fernández, Hélène Kirchner & Olivier Namet (2010): A strategy language for graph rewriting. Submitted, see http://www.oliviernamet.co.uk/Publications.html.
  17. Maribel Fernández & Olivier Namet (2010): Strategic Programming on Graph Rewriting Systems. In: Proc. of the 1st International Workshop on Strategies in Rewriting, Proving, and Programming.
  18. Chris Fox, Maribel Fernández & Shalom Lappin (2008): Lambda Calculus, Type Theory, and Natural Language II. J. Log. Comput. 18(2), pp. 203.
  19. Rubino Geiß, Gernot Veit Batz, Daniel Grund, Sebastian Hack & Adam Szalkowski (2006): GrGen: A Fast SPO-Based Graph Rewriting Tool. In: Andrea Corradini, Hartmut Ehrig, Ugo Montanari, Leila Ribeiro & Grzegorz Rozenberg: ICGT, Lecture Notes in Computer Science 4178. Springer, pp. 383–397.
  20. Jean Krivine, Robin Milner & Angelo Troina (2008): Stochastic Bigraphs. Electr. Notes Theor. Comput. Sci. 218, pp. 73–96.
  21. Yves Lafont (1990): Interaction Nets. In: Proc. of the 17th ACM Symposium on Principles of Programming Languages (POPL'90). ACM Press, pp. 95–108.
  22. Ulrich Nickel, Jörg Niere & Albert Zündorf (2000): The FUJABA environment. In: ICSE, pp. 742–745.
  23. Detlef Plump (2009): The Graph Programming Language GP. In: Symeon Bozapalidis & George Rahonis: CAI, Lecture Notes in Computer Science 5725. Springer, pp. 99–122.
  24. Arend Rensink (2003): The GROOVE Simulator: A Tool for State Space Generation. In: John L. Pfaltz, Manfred Nagl & Boris Böhlen: AGTIVE, Lecture Notes in Computer Science 3062. Springer, pp. 479–485.
  25. Grzegorz Rozenberg (1997): Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientific.
  26. Andy Schürr, Andreas J. Winter & Albert Zündorf (1997): The PROGRES Approach: Language and Environment.. In: 1997handbook2. World Scientific, pp. 479–546.
  27. J. R. Ullmann (1976): An Algorithm for Subgraph Isomorphism. JACM 23(1), pp. 31–42.
  28. Daqian Zhang & Kang Zhang (1997): Reserved Graph Grammar: A Specification Tool for Diagrammatic VPLs. In: Proc. of VL'97. IEEE Computer Society, pp. 284.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org