Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph Grammars and Their Application to Computer Science

Graph Grammars 1982: Graph-Grammars and Their Application to Computer Science pp 58–81Cite as

Aspects of concurrency in graph grammars

  • Conference paper
  • First Online:

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

Abstract

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.

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. Christensen, C.: An example of the manipulation of directed graphs in the AMBIT/G programming language, in Klerer/Reinfelds (Eds.): Interactive Systems for Applied Mathematics, New York: Academic Press 1968.

    Google Scholar 

  2. Pfaltz, J.L., Rosenfeld, A.: Web Grammars, Proc. Int. Joint Conf. Art. Intelligence, Washington, 609–619 (1969).

    Google Scholar 

  3. Shaw, A.C.: A Formal Description Scheme as a Basis for Picture Processing Systems, Inf. Contr. 14, 9–52 (1969).

    Google Scholar 

  4. Montanari, U.G.: Separable Graphs, Planar Graphs and Web Grammars, Inf. Contr. 16, 243–267 (1970).

    Google Scholar 

  5. Schneider, H.J.: Chomsky-Systeme für partielle Ordnungen, Arbeitsber.d. Inst. f. Math. Masch. u. Datenver. 3, 3, Erlangen (1970).

    Google Scholar 

  6. Pratt, T.: Pair Grammars, Graph Languages and String-to-Graph Translations, Journ. Comp. Sci. 5, 560–595 (1971).

    Google Scholar 

  7. Fu, K.S.: On syntactical pattern recognition and stochastic languages, in S. Watanabe (Ed.): Frontiers of Pattern Recognition, 113–137, New York: Academic Press 1972.

    Google Scholar 

  8. Schneider, H.J.: A necessary and sufficient condition for Chomsky-productions over partielly ordered symbol sets, Lect.Not.in Econ.,and Math.Syst. 78, 90–98 (1972).

    Google Scholar 

  9. Ehrig, H., Pfender, M., Schneider, H. J.: Graph-Grammars: An Algebraic Approach, Proc. of the IEEE Conf. on Automata and Switching Theory, Iowa City 1973, p. 167–180.

    Google Scholar 

  10. Franck, R., Denert, E., Streng, W.: PLAN2D — Ein Ansatz zur Definition einer zweidimenslonalen Programmiersprache. Fachgespräch über mehrdimensionale Formale Sprachen, Erlangen 1973, Arbeitsber. des Inst. f. Math. Masch. und DV (Informatik) der Univ. Nürnberg-Erlangen, Bd. 6, Nr.3, 4–29.

    Google Scholar 

  11. Nagl, M.: Eine Präzisierung des Pfaltz/Rosenfelschen Produktionsbegriffes bei mehrdimensionalen Grammatiken, Arbeitsber. d. Inst. f.Masch. u. DV 6, 3, 56–71, Erlangen (1973).

    Google Scholar 

  12. Culik, K. II., Lindenmayer, A.: Parallel Rewriting on Graphs and Multidimensional Development, Techn.Rep.CS-74-22, Univ.of Waterloo, Canada (1974).

    Google Scholar 

  13. Gottlieb, C.C., Furtado, A.L.: Data Schemata Based on Directed Graphs, Techn. Rep. 70, Comp. Sci. Dept. Univ. of Toronto (1974), also Int. Journ. Comp. and Inf. Sci. 8, 1, 39–73 (1979).

    Google Scholar 

  14. Mayoh, B.H.: Multidimensional Lindenmayer Organisms, Lect. Notes in Comp. Sci. 15, 302–326, Berlin: Springer-Verlag 1974.

    Google Scholar 

  15. Ehrig, H.: An Approach to Context-free Parallel Graph-Grammars, Techn. Rep. No. 75-30, Techn. Univ. Berlin, 1975.

    Google Scholar 

  16. Ehrig, H., Kreowski, H.-J.: Church-Rosser Theorems leading to Parallel and Canonical Derivations in Graph-Grammars, Techn. Report No. 75-27, Techn. Univ. Berlin (1975).

    Google Scholar 

  17. Nagl, M.: Graph Lindenmayer-Systems and Languages, Arbeitsber. d. Inst. f. Math. Masch. u. Datenver. 8, 1, 16–63, Erlangen (1975).

    Google Scholar 

  18. ADJ (Goguen, J.A., Thatcher, J.W., Wagner, E.G.): An initial algebra approach to the specification, correctness and implementation of abstract data types; IBM Research Report RC-6487 (1976), Current Trends in Programing Methodology IV: Data Structuring (Ed. Yeh, R.T.) Prentice Hall, N.J. (1978), 80–149.

    Google Scholar 

  19. Ehrig, H., Kreowski, H.-J.: Parallel Graph Grammars,in “Automata, Languages, Development”, (Eds. A. Lindenmayer and G. Rozenberg), North-Holland, Amsterdam 1976, 425–442

    Google Scholar 

  20. —: Parallelism of Manipulations in Multidimensional Information Structures, Proc. Conf. Math. Foundations of Comp. Sci., Gdansk 1976, Springer Lect. Not. in Comp. Sci. 45 (1976), 284–293.

    Google Scholar 

  21. Ehrig, H., Rosen, B.K.: Commutativity of Independent Transformations on Complex Objects, IBM Research Report, RC 6251, October 1976.

    Google Scholar 

  22. Ehrig, H., Rozenberg, G.: Some Definitional Suggestions for Parallel GraphGrammars, in “Automata, Languages, Development”, (Eds. A. Lindenmayer and G. Rozenberg), North-Holland, Amsterdam 1976, 443–468.

    Google Scholar 

  23. Della Vigna, P.L., Ghezzi, C.: Data Structures and Graph Grammars, Lect. Not. Comp. Sci. 44, 130–145, Berlin: Springer Verlag 1976.

    Google Scholar 

  24. Kreowski, H.-J.: Kanonische Ableitungssequenzen für Graph-Grammatiken, Techn. Report No. 76-22, Techn. Univ. Berlin, 1976.

    Google Scholar 

  25. Ehrig, H.: Embedding Theorems in the Algebraic Theory of Graph-Grammars, Springer Lect. Not. in Comp. Sci. 56, 245–255, 1977.

    Google Scholar 

  26. Ehrig, H., Rosen, B.K.: The Mathematics of Record Handling, Springer Lect. Not. in Comp. Sci. 52, 206–220, 1977.

    Google Scholar 

  27. Negraszus-Patan, G.: Anwendungen der algebraischen Graphentheorie auf die formale Beschreibung und Manipulation eines Datenbankmodells, Diplomarbeit am FB 20, TU Berlin, 1977.

    Google Scholar 

  28. Ehrig, H.: Introduction to the Algebraic Theory of Graph Grammars, Techn. Report No. 78-28, TU Berlin, (1978); also in LNCS 73 (1979), pp. 1–69.

    Google Scholar 

  29. Ehrig, H., Kreowski, H.-J., Maggiolo-Schettini, A., Rosen, B.K., Winkowski, J.: Deriving Structures from Structures, in: Proc. 7th Int. Symp. on Math. Found. of Comp. Sci., Zakopane 1978, LNCS 64 (1978), pp. 177–190; also in IBM Research Report RC 7046 (1978).

    Google Scholar 

  30. Ehrig, H., Rosen, B.K.: Concurrency of Manipulation in Multidimensional Information Structures, in: Proc. 7th Int. Symp. on Math. Found. of Comp. Sci., Zakopane 1978, LNCS 64 (1978), pp. 165–176, long version in: Techn. Report No. 78-13, TU Berlin (1978).

    Google Scholar 

  31. Kreowski, H.-J.: Anwendungen der Algebraischen Theorie von Graph-Grammatiken auf Konsistenz und Synchronisation in Datenbanksystemen, Techn. Report No. 78-15, TU Berlin, April 1978.

    Google Scholar 

  32. Padawitz, P.: Graph Grammars and Operational Semantics, Techn. Report No. 78-33, TU Berlin (1978), and in: Proc. of the Int. Workshop on Graph Grammars and Their Applications to Comp. Sci. and Biology, Bad Honnef, 1978, LNCS 73 (1979), pp. 350–366.

    Google Scholar 

  33. Ehrig, H., Kreowski, H.-J.: A Graph Grammar Approach to Optimal and Consistency Schedules in Data Base Systems, Proc. Workshop WG'79 Graphentheoretische Konzepte in der Informatik, Berlin 1979.

    Google Scholar 

  34. Ehrig, H., Rosen, B.K.: Commutativity, Parallelism and Concurrency for Transformations of Structures, TU Berlin, Techn. Report No. 79-21, 1979.

    Google Scholar 

  35. —: Decomposition of Graph Grammars, Productions and Derivations, LNCS 73 (1979), pp. 192–205.

    Google Scholar 

  36. Maggiolo-Schettini, A., Winkowski, J.: Processes in Structures, Lect.Not. Comp. Sci. 73, 317–330 (1979).

    Google Scholar 

  37. Brauer, W.: Net Theory and Applications, LNCS 84 (1980).

    Google Scholar 

  38. Ehrig, H., Kreowski, H.-J.: Applications of Graph Grammar Theory to Consistency, Synchronization and Scheduling in Data Base Systems, Inform. Syst., Vol. 5, pp. 225–238, Pergamon Press Ltd., 1980.

    Google Scholar 

  39. Ehrig, H. Rosen, B.K.: The Mathematics of Record Handling, SIAM J. COMPUT, Vol. 9, No. 3, August 1980.

    Google Scholar 

  40. Habel, A.: Concurrency in Graph-Grammatiken, TU Berlin, Techn. Report No. 80-11, March 1980.

    Google Scholar 

  41. Ehrig, H., Kreowski, H.-J., Maggiolo-Schettini, A., Rosen, B.K., Winkowski, J.: Transformations of Structures: An Algebraic Approach, Math. Syst. Theory 14, pp. 305–334, (1981).

    Google Scholar 

  42. Habel, A.: Komposition und Dekomposition von Produktionen zur Manipulation von Graphen, Diplomarbeit, TO Berlin, FB Mathematik (3), April 1981.

    Google Scholar 

  43. Kreowski, H.-J.: A Comparison Between Petri-Nets and Graph Grammars, Proc. Graphtheoretic Concepts in Comp. Sci. 1980, LNCS 100 (1981).

    Google Scholar 

  44. Reisig, W.: A Graph Grammar Representation of Nonsequential Processes, in H. Noltemeier (Ed.): “Graphtheoretic Concepts in Comp. Sci.” LNCS 100, Berlin: Springer Verlag 1981.

    Google Scholar 

  45. Wilharm, A.: Anwendung der Theorie von Graphgrammatiken auf die Spezifikation der Prozess-Steuerung von Eisenbahnsystemen, Tu Berlin, Techn.Rep. No. 81-15, August 1981.

    Google Scholar 

  46. Castellani, I., Montanari, U.: Graph Grammars for Distributed Systems, Techn. Report, Univ. of Pisa, 1982.

    Google Scholar 

  47. Ehrig, H.: Applications of Conditional Graph Productions to Consistency, Synchronization and Scheduling in Data Base Systems, Bulletin of the European Association for Theoretic. Comp. Sci. 16 (Feb. 1982), pp. 24–30.

    Google Scholar 

  48. Ehrig, H., Habel, A., Rosen, B.K.: Concurrent Transformations of Structures, to appear

    Google Scholar 

  49. Ehrig, H., Staples, J.: Church-Rosser Properties for Graph Replacement Systems with Distinguished Splitting, Techn. Report No. 36 (1982), Dept. of Comp. Sci., Univ. of Queensland, St. Lucia, Australia, also this vol.

    Google Scholar 

  50. Furtado, A.L., Veloso, P.A.S.: Specification of Data Bases through Rewriting Rules, Univ. Catolica, Rio de Janeiro, Brasil; this volume.

    Google Scholar 

  51. Genrich, H.J., Jannsens, D., Rozenberg, G., Thiagarajan, P.S.: Generalized Handle Grammars and Their Relation to Petri Nets, Techn. Report, No. 82-01, 1982.

    Google Scholar 

  52. Hansen, H.: Concurrency in Algebraischen Spezifikationen, in preparation.

    Google Scholar 

  53. Habel, A., Kreowski, H.-J.: Context-free Graph Languages Generated by Edge Replacement, TU Berlin and Univ. Bremen, this volume.

    Google Scholar 

  54. Hasler, K.P., Löwe, M, Reisin, F.M.: Algebraic Specification of a User Controlled Interpreter for Algebraic Specifications, Poster Session Proc. 6th Int. Conf. Soft. Eng., Tokyo 1982.

    Google Scholar 

  55. Hoffmann, B.: Modeling Compiler Generation by Graph Grammars, TU Berlin, this volume.

    Google Scholar 

  56. Jannsens, D., Kreowski, H.-J., Rozenberg, G., Ehrig, H.: Concurrency of Node-Label-Controlled Graph Transformations, Techn. Report, TU Berlin 1982, submitted to SIAM Journal on Comp.

    Google Scholar 

  57. Maggiolo-Schettini, A., Winkowski, J.: An Application of Processes of Transforming Structures to Scheduling Programs Accessing a Relational Data Base, Univ. of Torino (Italy) and Polish Academy of Sci. Warsaw (Poland), to appear 1982

    Google Scholar 

  58. Mahr, B., Wilharm, A.: Graph Grammars as a Tool for Description in Comp. Processed Control: A Case Study, (to appear in Proc. of the WG'82).

    Google Scholar 

  59. Nagl, M., Engels, G., Gall, R., Schäfer, W.: Software Specification by Graph Grammars, Univ. of Osnabrück and Univ. of Erlangen; this volume.

    Google Scholar 

  60. Padawitz, P.: Graph Grammars and Operational Semantics, Theoret. Comp. Sci. 19 (1982), pp. 117–141.

    Google Scholar 

  61. Pratt, T.: Formal Specification using H-Graph Grammars, Univ. of Virginia, this volume.

    Google Scholar 

  62. Rozenberg, G., Jannsens, D.: NLC Grammars; Univ. of Leiden and Univ. of Antwerp; this volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Berlin, Franklinstr. 28/29, D-1000, Berlin 10

    Hartmut Ehrig

Authors
  1. Hartmut Ehrig
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Ehrig Manfred Nagl Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ehrig, H. (1983). Aspects of concurrency in graph grammars. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1982. Lecture Notes in Computer Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000099

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12310-1

  • Online ISBN: 978-3-540-39897-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation