Hierarchically distributed graph transformation

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

Volumn 1073, Issue , 1996, Pages 304-320

  Taentzer, Gabriele ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Communication; Distributed systems; Graph transformation; Synchronization

Indexed keywords

COMMUNICATION; CONTEXT SENSITIVE GRAMMARS; FORMAL LANGUAGES; SYNCHRONIZATION;

COMMUNICATION AND SYNCHRONIZATIONS; DISTRIBUTED GRAPH TRANSFORMATION; DISTRIBUTED SYSTEMS; DISTRIBUTION TOPOLOGY; GRAPH TRANSFORMATION; HIGH LEVEL REPLACEMENT SYSTEMS; NETWORK ACTIVITIES; OPEN DISTRIBUTED SYSTEMS;

GRAPH THEORY;

EID: 35048834021     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61228-9_95     Document Type: Conference Paper

References (16)

1. J. Adamek, H. Herrlich, and G. Strecker. Abstract and Concerte Categories. Series in Pure and Applied Mathematics. John Wiley and Sons, 1990.
2. I. Classen, M. Löwe, S. Wasserroth, and J. Wortmann. Static and dynamic semantics of entity-relationship models based on algebraic methods, to appear in proc. IFIP-Congress and GI-Fachgespräche, Hamburg, 1994.
3. P. Degano and U. Montanari. A model of distributed systems based on graph rewriting. Journal of the ACM, 34(2):411-449, 1987.
4. H. Ehrig. Introduction to the algebraic theory of graph grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, 1st Graph Grammar Workshop, Lecture Notes in Computer Science 73, pages 1-69. Springer Verlag, 1979.
5. H. Ehrig, P. Boehm, U. Hummert, and M. Löwe. Distributed parallelism of graph transformation. In 13th Int. Workshop on Graph Theoretic Concepts in Computer Science, LNCS 314, pages 1-19, Berlin, 1988. Springer Verlag.
6. H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce. From graph grammars to High Level Replacement Systems. In Ehrig et al. [7], pages 269-291. Lecture Notes in Computer Science 532.
7. H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors. 4th International Workshop on Graph Grammars and Their Application to Computer Science. Springer Verlag, 1991. Lecture Notes in Computer Science 532.
8. H Ehrig and M. Löwe. Parallel and distributed derivations in the single pushout approach. TCS, 109:123-143, 1993.
9. S.M. Kaplan, J.P. Loyall, and S.K. Goering. Specifying concurrent languages and systems with Δ-grammars. In Ehrig et al. [7], pages 475-489. Lecture Notes in Computer Science 532.
10. D. Kips and G. Heidenreich. Project flow graphs-a meta-model to support quality assurance in software-engineering, to appear in proc. of IEPM’95, 1995.
11. M. Korff. Single pushout transformations of equationally defined graph structures with applications to actor systems. In Proc. Graph Grammar Workshop Dagstuhl 93, pages 234-247. Springer Verlag, 1994. Lecture Notes in Computer Science 776.
12. P. Pepper and M. Wirsing. KORSO: A methodology for the development of correct software, to be published in LNCS, 1995.
13. G. Schied. Über Graphgrammatiken, eine Spezifikationsmethode für Programmier-sprachen und verteilte Regelsysteme. Arbeitsberichte des Institus für mathematis-che Maschinen und Datenverarbeitung (Informatik), University of Erlangen, 1992.
14. H.-J. Schneider. On categorical graph grammars integrating structural transformation and operations on labels. TCS, 109:257-274, 1993.
15. G. Taentzer. Towards synchronous and asynchronous graph transformations, accepted for special issue of Fundamenta Informaticae, 1995.
16. G. Taentzer and A. Schürr. DIEGO, another step towards a module concept for graph transformation systems, to appear in proc. of SEGRAGRA’95“ Graph Rewriting and Computation”, published in Electronic Notes of TCS, 1995.