Specifying concurrent languages and systems with Δ-grammars

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

Volumn 532 LNCS, Issue , 1991, Pages 475-489

  Kaplan, Simon M ^a   Loyall, Joseph P ^a   Goering, Steven K ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Concurrent languages; Concurrent systems; Dynamic; Graph grammars; Visual; GRAMMARS

Indexed keywords

CONTEXT SENSITIVE GRAMMARS; DYNAMICS; FORMAL LANGUAGES; VISUAL LANGUAGES;

CONCURRENT LANGUAGES; CONCURRENT SYSTEMS; GRAPH GRAMMAR; VISUAL;

GRAPH THEORY;

EID: 18944371603     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0017407     Document Type: Conference Paper

References (25)

1. Gul Agha. ACTORS: A Model of Concurrent Computation in Distributed Systems. M.I.T. Press, Cambridge, Mass., 1986.
2. Wilfried Brauer, editor. Net Theory and Applications, Lecture Notes in Computer Science 84, Springer-Verlag, Berlin, 1980.
3. H. Ehrig and A. Habel. Graph grammars with application conditions. In G. Rozenberg and A. Salomaa, editors, The Book of L, Springer-Verlag, Berlin, 1986.
4. Hartmut Ehrig. Introduction to the algebraic theory of graph grammars (a survey). In Yolker Claus, Hartmut Ehrig, and Grzegorz Rozenberg, editors, Graph Grammars and their Application to Computer Science and Biology, LNCS 73, pages 1-69, Springer-Verlag, Heidelberg, 1979.
5. Hartmut Ehrig. Tutorial introduction to the algebraic approach of graph-grammars. In Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, and Azriel Rosenfeld, editors, Graph Grammars and their Application to Computer Science, LNCS 891, pages 3-14, Springer-Verlag, 1987.
6. Steven K. Goering. A Graph-Grammar Approach to Concurrent Programming. PhD thesis, University of Illinois at Urbanar Champaign, 1990. Tech. report UIUCDCS-R-90-1576.
7. Steven K. Goering, Simon M. Kaplan, and Joseph P. Loyall. Theoretical properties of A. Book in preparation.
8. H. Göttler. Semantical description by two-level graph-grammars for quasihierarchical graphs. In Proc. ‘Workshop WG 78 on Graphtheoretical Concepts in Comp. Science’, Applied Computer Science, 13, Hanser-Verlag, Munich, 1979.
9. Herbert Göttler. Attributed graph grammars for graphics. In Hartmut Ehrig, Manfred Nagl, and Grzegorz Rozenberg, editors, Graph Grammars and their Application to Computer Science, LNCS 153, pages 130-142, Springer-Verlag, 1982.
10. Herbert Göttler. Graph grammars and diagram editing. In Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, and Azriel Rosenfeld, editors, Graph Grammars and their Application to Computer Science, LNCS 291, pages 216-231, Springer-Verlag, 1987.
11. Annegret Habel. Hyperedge Replacement: Grammars and Languages. PhD thesis, University of Bremen, 1989.
12. Annegret Habel and Hans-Jorg Kreowski. May we introduce to you: hyperedge replacement. In Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, and Azriel Rosenfeld, editors, Graph Grammars and their Application to Computer Science, LNCS 291, pages 15-26, Springer-Verlag, 1987.
13. Manfred Jackel. Ada-concurrency specified by graph grammars. In Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, and Azriel Rosenfeld, editors, Graph Grammars and their Application to Computer Science, LNCS 291, pages 262-279, Springer-Verlag, 1987.
14. Manfred Jackel. Specification of the Concurrent Constructs of Ada by Graph Grammars (in German). PhD thesis, University of Osnabrück, 1986.
15. D. Janssens and Grzegorz Rozenberg. Basic notions of actor grammars. In Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, and Azriel Rosenfeld, editors, Graph Grammars and their Application to Computer Science, LNCS 291, pages 280-298, Springer-Verlag, 1987.
16. Dirk Janssens and Grzegorz Rozenberg. Graph grammars with node-label control and rewriting. In Hartmut Ehrig, Manfred Nagl, and Grzegorz Rozenberg, editors, Graph Grammars and their Applica-tion to Computer Science, LNCS 153, pages 186-205, Springer-Verlag, 1982.
17. Simon M. Kaplan. Foundations of visual languages for object-based concurrent programming. In Gul Agha, Peter Wegner, and Akinori Yonezawa, editors, Object-Based Concurrent Programming, Addison-Wesley, to appear 1990.
18. Simon M. Kaplan, Steven K. Goering, Joseph P. Loyall, and Roy H. Campbell. A Working Papers. Technical Report UIUCDCS-R-90-1597, University of Illinois Department of Computer Science, April 1990.
19. Joseph P. Loyall. Specification of Concurrent Programs Using Graph Grammars. PhD thesis, University of Illinois, To appear, 1991.
20. Michael Main and Grzegorz Rozenberg. Fundamentals of edge-label controlled graph grammars. In Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, and Azriel Rosenfeld, editors, Graph Grammars and their Application to Computer Science, LNCS 291, pages 411-426, Springer-Verlag, 1987.
21. R. Milner. A calculus of communicating systems. In Lecture Notes in Computer Science, LNCS 92, Springer-Verlag, Berlin, 1980.
22. M. Nagl. Graph Grammars: Theory, Application, Implementation (in German). Verlag, Wiesbaden: Vieweg, 1979.
23. Francesco Parisi-Presicce, Hartmut Ehrig, and Ugo Montanari. Graph rewriting with unification and composition. In Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, and Azriel Rosenfeld, editors, Graph Grammars and their Application to Computer Science, LNCS 291, pages 496-514, Springer-Verlag, 1987.
24. Grzegorz Rozenberg. An introduction to the NLC way of rewriting graphs. In Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, and Azriel Rosenfeld, editors, Graph Grammars and their Application to Computer Science, LNCS 291, pages 55-66, Springer-Verlag, 1987.
25. H.J. Schneider. Describing distributed systems by categorical graph grammars. In LNCS 411, pages 121-135, Springer-Verlag, Heidelberg, 1989.