Parallel High-Level Replacement Systems

Abstract High-level replacement systems are an axiomatic categorical framework based on doublepushouts in order to unify replacement systems like grammars for different kinds of graphs and relational structures or other types of structures like algebraic specifications. Parallel high-level replacement systems are introduced to formalize parallel rewriting of these high-level structures. On one hand this concept generalizes and extends parallel graph grammars presented so far in the algebraic approach by allowing other structures than graphs, on the other hand the kinds of replacement introduced for high-level replacement systems are extended by different types of parallel replacement which are compared to each other in different parallel replacement theorems. An abstract version of a window-based graph editor and movement of objects in configuration spaces are presented as examples of parallel high-level replacement systems.

[1]  Annegret Habel,et al.  Amalgamation of Graph Transformations: A Synchronization Mechanism , 1987, J. Comput. Syst. Sci..

[2]  Hartmut Ehrig,et al.  Graph rewriting with unification and composition , 1986, Graph-Grammars and Their Application to Computer Science.

[3]  Horst Herrlich,et al.  Abstract and concrete categories , 1990 .

[4]  Michael Löwe,et al.  Algebraic Approach to Single-Pushout Graph Transformation , 1993, Theor. Comput. Sci..

[5]  Julia Padberg.  Survey of High-Level Replacement Systems , 1993 .

[6]  Hartmut Ehrig,et al.  Parallelism and Concurrency of Graph Manipulations , 1980, Theor. Comput. Sci..

[7]  Gabriele Taentzer,et al.  Movement of Objects in Configuration Spaces modelled by graph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

[8]  Hans-Jörg Kreowski.  Parallel Hyperedge Replacement , 1992 .

[9]  Hartmut Ehrig,et al.  Parallelism and concurrency in high-level replacement systems , 1991, Mathematical Structures in Computer Science.

[10]  Francesco Parisi-Presicce.  Foundations of Rule-Based Design of Modular Systems , 1991, Theor. Comput. Sci..

[11]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 2: Module Specifications and Constraints , 1990 .

[12]  Annegret Habel,et al.  Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.

[13]  Michael Löwe,et al.  Extended algebraic graph transformation , 1991 .

[14]  Hartmut Ehrig,et al.  From Parallel Graph Grammars to Parallel High-Level Replacement Systems , 1992 .

[15]  Grzegorz Rozenberg,et al.  On the structure of node-label-controlled graph languages , 1980, Inf. Sci..

[16]  Michael Löwe,et al.  AGG - An Implementation of Algebraic Graph Rewriting , 1993, RTA.

[17]  Akira Nakamura,et al.  On a Relationship between Graph L-Systems and Picture Languages , 1983, Theor. Comput. Sci..

[18]  Grzegorz Rozenberg,et al.  Automata, languages, development , 1976 .

[19]  Duane A. Bailey,et al.  Programming with Very Large Graphs , 1990, Graph-Grammars and Their Application to Computer Science.

[20]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[21]  S. Maclane,et al.  Categories for the Working Mathematician , 1971 .

[22]  Hartmut Ehrig.  Distributed Parallelism of Graph Transformations , 1987, WG.

[23]  Manfred Nagl.  Set theoretic approaches to graph grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[24]  José Meseguer,et al.  Petri nets are monoids: a new algebraic foundation for net theory , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[25]  Udo Hummert.  Algebraische Theorie von High-Level-Netzen , 1989 .

[26]  会沢 邦夫,et al.  On a Relationship between Graph L-Systems and Picture Languages (数理情報科学の基礎理論と応用) , 1981 .

[27]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[28]  Grzegorz Rozenberg,et al.  The Book of L , 1986, Springer Berlin Heidelberg.

[29]  Grzegorz Rozenberg.  An introduction to the NLC way of rewriting graphs , 1986, Graph-Grammars and Their Application to Computer Science.

[30]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1986, Lecture Notes in Computer Science.

[31]  Hartmut Ehrig,et al.  Parallel and Distributed Derivations in the Single-Pushout Approach , 1993, Theor. Comput. Sci..

[32]  Gabriele Taentzer,et al.  Amalgamated Graph Transformations and Their Use for Specifying AGG - an Algebraic Graph Grammar System , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[33]  Hartmut Ehrig,et al.  Algebraic high-level net transformation systems , 1995, Mathematical Structures in Computer Science.