Skip to main content
SpringerLink
Log in

Parallel Composition of Graph Grammars

  • Published:
Applied Categorical Structures Aims and scope Submit manuscript

Abstract

The specification of complex systems is usually done by the ‘divide and conquer’ idea: the system is divided into smaller, less complex components that are developed separately and then merged in some way to form the specification of the whole system. The main aim of this paper is to provide an approach to the parallel composition of graph grammars, formalizing the intuitive idea of ‘divide and conquer’ described above. This parallel composition of graph grammars provides a suitable formalism for the specification of concurrent systems based on the specifications of their components. ‘Dividing’ is formalized by special graph grammar morphisms, called specialization morphisms. These morphisms also describe structural and behavioural compatibilities between graph grammars. As a main result, we characterize the parallel composition as the pullback in the category of graph grammars.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Böhm, P., Fonio, H.-R. and Habel, A.: Amalgamation of graph transformations: A synchronization mechanism, J. Comput. System Sci. 34 (1987), 377-408.

    Google Scholar 

  2. Corradini, A., Ehrig, H., Löwe, M., Montanari, U. and Padberg, J.: The category of typed graph grammars and their adjunction with categories of derivations, in 5th Int. Workshop on Graph Grammars and their Application to Computer Science, Lecture Notes in Comput. Sci. 1073, Springer, 1996, pp. 56-74.

  3. Corradini, A. and Heckel, R.: A compositional approach to structuring and refinement of typed graph grammars, Electronic Notes in Theoret. Comput. Sci. 2 (1995), 167-176, Proc. of the SEGRAGRA'95 Workshop on Graph Rewriting and Computation.

    Google Scholar 

  4. Corradini, A., Montanari, U. and Rossi, F.: Graph processes, Fund. Inform. 26(3–4) (1996), 241-265.

    Google Scholar 

  5. Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R. and Löwe, M.: Algebraic approaches to graph transformation I: Basic concepts and double pushout approach, in: The Handbook of Graph Grammars, Volume 1: Foundations, World Scientific, 1997.

  6. Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A. and Corradini, A.: Algebraic approaches to graph transformation II: Single pushout approach and comparison with double pushout approach, in: The Handbook of Graph Grammars, Volume 1: Foundations, World Scientific, 1997.

  7. Ehrig, H.: Introduction to the algebraic theory of graph grammars, in V. Claus, H. Ehrig and G. Rozenberg (eds.), 1st Graph Grammar Workshop, Lecture Notes in Comput. Sci. 73, Springer, 1979, pp. 1-69.

  8. Ehrig, H. and Mahr, B.: Fundamentals of Algebraic Specification 2: Module Specifications and Constraints, EATCS Monographs on Theoretical Computer Science, Vol. 21, Springer, 1990.

  9. Ehrig, H., Pfender, M. and Schneider, H. J.: Graph grammars: An algebraic approach, in 14th Annual IEEE Symposium on Switching and Automata Theory, 1973, pp. 167-180.

  10. Heckel, R., Corradini, A., Ehrig, H. and Löwe, M.: Horizontal and vertical structuring of typed graph transformation systems, Math. Struct. Comput. Sci. 6(6) (1996), 613-648.

    Google Scholar 

  11. Janssens, D.: ESM systems and the composition of their computations, in Proc. Graph Grammar Workshop Dagstuhl 93, Lecture Notes in Comput. Sci. 776, Springer, 1993, pp. 203-217.

  12. Janssens, D.: The decomposition of ESM computations, in 5th Int. Workshop on Graph Grammars and their Application to Computer Science, Lecture Notes in Comput. Sci. 1073, Springer, 1996, pp. 271-287.

  13. Korff, M.: Single pushout transformations of generalized graph structures, Tech. Report RP 220, Federal University of Rio Grande do Sul, Porto Alegre, Brazil, 1993.

    Google Scholar 

  14. Korff, M.: True concurrency semantics for single pushout graph transformations with applications to actor systems, in R. J. Wieringa and R. B. Feenstra (eds.), Information Systems — Correctness and Reusability, World Scientific, 1995, pp. 33-50.

  15. Korff, M.: Generalized graph structure grammars with applications to concurrent object-oriented systems, Ph.D. Thesis, Technical University of Berlin, 1996.

  16. Löwe, M.: Extended algebraic graph transformations, Ph.D. Thesis, Technical University of Berlin, 1990, short version in TCS 109; 181-224.

  17. Löwe, M.: Algebraic approach to single-pushout graph transformation, Theoret. Comput. Sci. 109 (1993), 181-224.

    Google Scholar 

  18. Meseguer, J., Montanari, U. and Sassone, V.: On the semantics of place/transition Petri nets, Math. Struct. Comput. Sci. 7 (1997), 359-397.

    Google Scholar 

  19. Ribeiro, L.: Parallel composition and unfolding semantics of graph grammars, Ph.D. Thesis, Technical University of Berlin, 1996.

  20. Ribeiro, L.: A telephone system's specification using graph grammars, Tech. Report 96-23, Technical University of Berlin, 1996.

  21. Winskel, G. and Nielsen, M.: Models for concurrency, Tech. Report BRICS RS-94-12, University of Aarhus, 1994.

Download references

Author information

Authors and Affiliations

  1. Instituto de Informática, Universidade Federal do Rio Grande do Sul, Av. Bento Gonçalves, 9500 – Bl. IV, 91.501-970, Porto Alegre, Brazil. e-mail

    Leila Ribeiro

Authors
  1. Leila Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ribeiro, L. Parallel Composition of Graph Grammars. Applied Categorical Structures 7, 405–430 (1999). https://doi.org/10.1023/A:1008691205954

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008691205954

Search

Navigation