Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph Grammars and Their Application to Computer Science

Graph Grammars 1990: Graph Grammars and Their Application to Computer Science pp 475–489Cite as

Specifying concurrent languages and systems with Δ-grammars

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 532))

Abstract

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.

Supported in part by the National Science Foundation under grant CCR-8809479, by the Center for Supercomputing Research and Development at the University of Illinois and by AT&T through the Illinois Software Engineering Project. Steve Goering has been supported as an IBM fellow.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gul Agha. ACTORS: A Model of Concurrent Computation in Distributed Systems. M.I.T. Press, Cambridge, Mass., 1986.

    Google Scholar 

  2. Wilfried Brauer, editor. Net Theory and Applications, Lecture Notes in Computer Science 84, Springer-Verlag, Berlin, 1980.

    Google Scholar 

  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.

    Google Scholar 

  4. Hartmut Ehrig. Introduction to the algebraic theory of graph grammars (a survey). In Volker 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.

    Google Scholar 

  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 291, pages 3–14, Springer-Verlag, 1987.

    Google Scholar 

  6. Steven K. Goering. A Graph-Grammar Approach to Concurrent Programming. PhD thesis, University of Illinois at Urbana-Champaign, 1990. Tech. report UIUCDCS-R-90-1576.

    Google Scholar 

  7. Steven K. Goering, Simon M. Kaplan, and Joseph P. Loyall. Theoretical properties of Δ. Book in preparation.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  11. Annegret Habel. Hyperedge Replacement: Grammars and Languages. PhD thesis, University of Bremen, 1989.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  14. Manfred Jackel. Specification of the Concurrent Constructs of Ada by Graph Grammars (in German). PhD thesis, University of Osnabrück, 1986.

    Google Scholar 

  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.

    Google Scholar 

  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 Application to Computer Science, LNCS 153, pages 186–205, Springer-Verlag, 1982.

    Google Scholar 

  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.

    Google Scholar 

  18. Simon M. Kaplan, Steven K. Goering, Joseph P. Loyall, and Roy H. Campbell. Δ Working Papers. Technical Report UIUCDCS-R-90-1597, University of Illinois Department of Computer Science, April 1990.

    Google Scholar 

  19. Joseph P. Loyall. Specification of Concurrent Programs Using Graph Grammars. PhD thesis, University of Illinois, To appear, 1991.

    Google Scholar 

  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.

    Google Scholar 

  21. R. Milner. A calculus of communicating systems. In Lecture Notes in Computer Science, LNCS 92, Springer-Verlag, Berlin, 1980.

    Google Scholar 

  22. M. Nagl. Graph Grammars: Theory, Application, Implementation (in German). Verlag, Wiesbaden: Vieweg, 1979.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  25. H.J. Schneider. Describing distributed systems by categorical graph grammars. In LNCS 411, pages 121–135, Springer-Verlag, Heidelberg, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Illinois, 1304 W. Springfield, 61801, Urbana, IL, USA

    Simon M. Kaplan, Joseph P. Loyall & Steven K. Goering

Authors
  1. Simon M. Kaplan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joseph P. Loyall
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Steven K. Goering
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Ehrig Hans-Jörg Kreowski Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaplan, S.M., Loyall, J.P., Goering, S.K. (1991). Specifying concurrent languages and systems with Δ-grammars . In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017407

Download citation

  • DOI: https://doi.org/10.1007/BFb0017407

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54478-4

  • Online ISBN: 978-3-540-38395-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation