Simple modules for grace

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1764, Issue , 2000, Pages 383-395

  Heckel, Reiko ^a   Hoffmann, Berthold ^b   Knirsch, Peter ^b   Kuske, Sabine ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

BINARY RELATION; COMPOUND GRAPHS; GRAPH TRANSFORMATION; INTERLEAVING SEMANTICS; LOCAL TRANSFORMATIONS; TRANSFORMATION UNITS;

GRAPH THEORY;

EID: 22844456361     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46464-8_27     Document Type: Conference Paper

References (19)

1. The Programming Language Ada. ISO standard 8652, 1995.See also at URL http://lglwww.epfl.ch/Ada/.
2. Marc Andries, Gregor Engels, Annegret Habel, Berthold Hoffmann, Hans-Jörg Kreowski, Sabine Kuske, Detlef Plump, Andy Schürr, and Gabriele Taentzer. Graph transformation for specification and programming. Science of Computer Programming 34:1–54, 1999.
3. Ken Arnold, and James Gosling. The Java Programming Language (2nd edition). Addison Wesley’s Java Series, 1998.
4. N. Christofides. Graph Theory: An Algorithmic Approach. Academic Press, Inc., London, 1975.
5. A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26(3,4):241–266, 1996.
6. H. Ehrig and G. Engels. Pragmatic and semantic aspects of a module concept for graph transformation systems. In 5th Int. Workshop on Graph Grammars and their Application to Computer Science, Williamsburg’94, LNCS 1073, pages 137–154. Springer Verlag, 1996.
7. M. Große-Rhode, F. Parisi-Presicce, and M. Simeoni. Spatial and temporal refinement of typed graph transformation systems. In Proc. Mathematical Foundations of Computer Science (MFCS’98), LNCS 1450, pages 553–561, Springer Verlag, 1998.
8. Annegret Habel, Reiko Heckel, and Gabriele Taentzer. Graph grammars with negative application conditions. Fundamenta Informaticae, XXVII:1/2, 1996.
9. Reiko Heckel and H. Ehrig and G. Engels and Gabriele Taentzer. Classifica-tion and comparison of module concepts for graph transformation systems. In G.Engels, H.Ehrig, H.-J. Kreowski, and G. Rozenberg (eds.): Handbook of Graph Grammars and Computing by Graph Transformation, Vol. II: Specification and Programming, to appear, 1999.
10. Berthold Hoffmann. From graph transformation to rule-based programming with diagrams. In M. Nagl, and A. Schürr, editors, Proc. Int’l Workshop and Symposium on Applications of Graph Transformation with Industrial Relevance (AGTIVE), to appear in Lecture Notes in Computer Science, 1999.
11. Hans-Jörg Kreowski and Sabine Kuske. On the interleaving semantics of transformation units — a step into GRACE. In Janice E. Cuny, Hartmut Ehrig, Gregor Engels, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science, number 1073 in Lecture Notes in Computer Science, pages 89–108, 1996.
12. Hans-Jörg Kreowski, Sabine Kuske, and Andy Schürr. Nested graph transformation units. International Journal on Software Engineering and Knowledge Engineering, 7(4):479–502, 1998.
13. Sabine Kuske. More about control conditions for transformation units. In Prelim. Proc. 6th Int. Workshop on Theory and Application of Graph Transformation (TAGT’98), Paderborn, pages 150–157, 1998.
14. John Peterson, Kevin Hammond, Lennart Augustsson, Brian Boutel, Warren Burton, Joseph Fasel, Andrew D. Gordon, John Hughes, Paul Hu-dak, Thomas Johnsson, Mark Jones, Erik Meijer, Simon Peyton Jones, Alistair Reid, and Philip Wadler. Report on the Programming Language Haskell, Version 1.4.Yale University, April 1997.See URL http://www.haskell.org/report/index.html.
15. Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. I: Foundations. World Scientific, Singapore, 1997.
16. Andy Schürr. PROGRES: A VHL-language based on graph grammars. In Hans-Jürgen Schneider and Hartmut Ehrig, editors, Proc. Graph Transformations in Computer Science, number 776 in Lecture Notes in Computer Science, pages 641–659, 1994.
17. A. Schürr. Programmed graph replacement systems. In Rozenberg [Roz97], pages 479–546.
18. Gabriele Taentzer and M. Beyer. Amalgamated graph transformation systems and their use for specifying AGG – an algebraic graph grammar system. In Hans-Jürgen Schneider and Hartmut Ehrig, editors, Proc. Graph Transformations in Computer Science, number 776 in Lecture Notes in Computer Science, pages 380–394, 1994.
19. G. Taentzer and A. Schürr. DIEGO, another step towards a module concept for graph transformation systems. Proc. of SEGRAGRA’95”Graph Rewriting and Computation”, Electronic Notes of TCS, 2, 1995. http://www.elsevier.nl/locate/entcs/volume2.html.