Skip to main content

Synchronized composition of graph grammar productions

  • Concurrency
  • Conference paper
  • First Online:
Graph Grammars and Their Application to Computer Science (Graph Grammars 1994)

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

Abstract

In the framework of the double-pushout approach to graph grammars, we propose a new notion of parallel composition, called synchronized composition, of production applications. Our aim is to allow (pairs of) productions which are possibly not parallel independent, to be applied in parallel, provided that they are not mutually exclusive. The notion of synchronized composition we propose is not comparable to amalgamation [BFH87], since two productions which are amalgable are not necessarily synchronizable, and viceversa. Our different idea of which productions should be applicable in parallel comes from our view of graph grammars as a generalization of Petri nets. The definitions and constructions we use are a conservative extension of the ones used in the classical theory of parallelism in the algebraic approach to graph grammars. Moreover, they can be the basis for the development of a more general concept of canonical derivations, and also for a generalization of the recently developed partial order and event structure semantics for graph grammars.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Böehm, H. Fonio and A. Habel. Amalgamation of graph transformations: a synchronization mechanism. In JCSS 34 (1987), 307–408.

    Google Scholar 

  2. A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi. Abstract Graph Derivations in the Double-Pushout Approach. In Proceedings Dagstuhl Seminar on Graph Trasformations in Computer Science. LNCS 776, Springer-Verlag, 1994, 86–103.

    Google Scholar 

  3. A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi. An event structure semantics for safe graph grammars. In Programming Concepts, Methods and Calculi, E.-R. Olderog ed., IFIP Transactions A-56, North Holland, 1994, 423–444.

    Google Scholar 

  4. A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi. Algebraic approach to graph transformation II: models of computations in the double pushout approach. Submitted.

    Google Scholar 

  5. A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi. An event structure semantics for graph grammars with parallel productions. In this volume.

    Google Scholar 

  6. H. Ehrig. Tutorial introduction to the algebraic approach of graph-grammars. In Proceedings 3rd International Workshop on Graph Grammars and their Application to Computer Science, LNCS 291, Springer-Verlag, 1987, 3–14.

    Google Scholar 

  7. H. Ehrig and R. Heckel and M. Korff and L. Ribeiro and A. Wagner. Algebraic Approach to Graph Transformation I: Tutorial Introduction and Single-Pushout Approach. Submitted for the Handbook of Graph Grammars, 1995.

    Google Scholar 

  8. R. Janicki and M. Koutny. Invariant semantics of nets with inhibitor arcs. In Proc. CONCUR. Springer-Verlag, LNCS 527, 1991.

    Google Scholar 

  9. R. Janicki and M. Koutny. Structure of concurrency. Theoretical Computer Science, 112:5–52, 1993.

    Google Scholar 

  10. J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. Event structures and orthogonal term graph rewriting. In M.J. Plasmejier M.R. Sleep and M.C.J.D. van Eekelen, editors, Term Graph Rewriting. Wiley Professional Computing, 1993.

    Google Scholar 

  11. H.-J. Kreowski. Manipulation von Graph Transformationen. Ph.D. Thesis, Technische Universität Berlin, 1977.

    Google Scholar 

  12. H.-J. Kreowski. Is parallelism already concurrency? Part 1: Derivations in graph grammars. In Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science. LNCS 291, Springer-Verlag, 1987, 343–360.

    Google Scholar 

  13. M. Löwe. Extended algebraic graph transformation. Ph.D. Thesis, Technische Universität Berlin, 1990.

    Google Scholar 

  14. M. Löwe. Algebraic approach to single-pushout graph transformation. In Theoret. Comput. Sci. 109 (1993) 181–224.

    Google Scholar 

  15. M. Löwe and J. Dingel. Parallelism in the Single-Pushout Graph Rewriting. In Proceedings Dagstuhl Seminar on Graph Trasformations in Computer Science, LNCS 776, Springer-Verlag, 1994.

    Google Scholar 

  16. R. Milner. A Calculus of Communicating Systems. In LNCS 92, 1980.

    Google Scholar 

  17. U. Montanari and F. Rossi. Graph grammars as context-dependent rewriting systems. In Proceedings CAAP92. Springer-Verlag, LNCS, 1992.

    Google Scholar 

  18. W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science, Springer-Verlag, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Janice Cuny Hartmut Ehrig Gregor Engels Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Corradini, A., Rossi, F. (1996). Synchronized composition of graph grammar productions. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_92

Download citation

  • DOI: https://doi.org/10.1007/3-540-61228-9_92

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61228-5

  • Online ISBN: 978-3-540-68388-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics