Aspects of concurrency in graph grammars

This paper is a written version of the overview lecture on “Concurrency in Graph Grammars” given at the “2nd International Workshop on Graph Grammars and their Applications to Computer Science, 1982”. The intention of that lecture and this paper is to show that a number of results in the transformational theory of graph grammars can be considered already as contributions towards a theory of concurrency in graph grammars. Simulations of Petri nets within graph grammars are reviewed and simulations of algebraic specifications within graph grammars are introduced to cover also abstract data type concepts. More general concepts of concurrency are considered to be studied in the framework of graph grammars which go essentially beyond those in Petri nets. Finally it is proposed to combine the new approach of Ugo Montanari for synchronization with the aspects of concurrency reviewed above to obtain a graph grammar based model for concurrent and distributed systems.

[1]  Hans-Jörg Kreowski,et al.  A Comparison Between Petri-Nets and Graph Grammars , 1980, WG.

[2]  Michael Thompson,et al.  Frontiers of Pattern Recognition , 1975 .

[3]  Hartmut Ehrig,et al.  The Mathematics of Record Handling , 1980, SIAM J. Comput..

[4]  Andrea Maggiolo-Schettini,et al.  Processes in Structures , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[5]  Hartmut Ehrig,et al.  Concurrency of Manipulations in Multidimensional Information Structures , 1978, MFCS.

[6]  Wolfgang Reisig.  A Graph Grammar Representation of Non-Sequential Processes , 1980, WG.

[7]  Carlos Christensen,et al.  An example of the manipulation of directed graphs in the AMBIT/G programming language , 1967, Symposium on Interactive Systems for Experimental Applied Mathematics.

[8]  Hartmut Ehrig,et al.  Embedding Theorem in the Algebraic Theory of Graph Grammars , 1977, FCT.

[9]  Azriel Rosenfeld,et al.  Web Grammars , 1969, IJCAI.

[10]  Ugo Montanari,et al.  Graph Grammars for distributed systems , 1982, Graph-Grammars and Their Application to Computer Science.

[11]  Annegret Habel,et al.  On context-free gragh languages generated by edge replacement , 1982, Graph-Grammars and Their Application to Computer Science.

[12]  Hartmut Ehrig,et al.  Deriving Structures from Structures , 1978, MFCS.

[13]  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.

[14]  Hartmut Ehrig,et al.  Parallelism of Manipulations in Multidimensional Information Structures , 1976, MFCS.

[15]  Hartmut Ehrig,et al.  Applications of Graph Grammar Theory to Consistency, Synchronization and Scheduling in Data Base Systems , 1980, Inf. Syst..

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

[17]  Terrence W. Pratt,et al.  Pair Grammars, Graph Languages and String-to-Graph Translations , 1971, J. Comput. Syst. Sci..

[18]  Carlo Ghezzi,et al.  Data Structures and Graph Grammars , 1976, ECI.

[19]  Hans Jürgen Schneider,et al.  A Necessary and Sufficient Condition for Chomsky-Productions Over Partially Ordered Symbol Sets , 1972, GI Jahrestagung.

[20]  Alan C. Shaw,et al.  A Formal Picture Description Scheme as a Basis for Picture Processing Systems , 1969, Inf. Control..

[21]  Brian H. Mayoh,et al.  Multidimensional Lindenmayer Organisms , 1974, L Systems.

[22]  Ugo Montanari,et al.  Separable Graphs, Planar Graphs and Web Grammars , 1970, Inf. Control..

[23]  Wilfried Brauer,et al.  Net Theory and Applications , 1980, Lecture Notes in Computer Science.

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

[25]  Hartmut Ehrig,et al.  Decomposition of Graph Grammar Productions and Derivations , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[26]  Peter Padawitz,et al.  Graph Grammars and Operational Semantics , 1978, Theor. Comput. Sci..

[27]  Manfred Nagl,et al.  Software specification by graph grammars , 1982, Graph-Grammars and Their Application to Computer Science.