Specifying Concurrent Languages and Systems with ???-Grammars

This paper illustrates the use of graph grammars for specifying concurrent systems and languages. The model used in this paper, Δ-Grammars, is rooted in existing graph grammar theory and provides a convenient framework in which to specify both static and dynamic concurrent systems. Our approach is illustrated by three examples.

[1]  Hans Jürgen Schneider,et al.  Describing Distributed Systems by Categorical Graph Grammars , 1989, WG.

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

[3]  Annegret Habel,et al.  May we introduce to you: hyperedge replacement , 1986, Graph-Grammars and Their Application to Computer Science.

[4]  Hartmut Ehrig,et al.  Tutorial introduction to the algebraic approach of graph grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[5]  Manfred Jackel,et al.  ADA-Concurrency specified by Graph Grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[6]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[7]  Herbert Göttler,et al.  Attributed graph grammars for graphics , 1982, Graph-Grammars and Their Application to Computer Science.

[8]  Gul A. Agha,et al.  ACTORS - a model of concurrent computation in distributed systems , 1985, MIT Press series in artificial intelligence.

[9]  Grzegorz Rozenberg,et al.  Basic notions of actor grammars: A graph grammar model for actor computation , 1986, Graph-Grammars and Their Application to Computer Science.

[10]  Steven K. Goering.  A graph grammar approach to concurrent programming , 1990 .

[11]  Simon M. Kaplan,et al.  Abstraction and composition in Delta -specifications of concurrent systems , 1991, Proceedings of the Sixth International Workshop on Software Specification and Design.

[12]  Hartmut Ehrig,et al.  Graph Grammars with Application Conditions , 1986 .

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

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

[15]  Grzegorz Rozenberg,et al.  Fundamentals of edge-label controlled graph grammars , 1986, Graph-Grammars and Their Application to Computer Science.

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

[17]  Herbert Göttler,et al.  Graph grammars and diagram editing , 1986, Graph-Grammars and Their Application to Computer Science.