Skip to main content

Distributed parallelism of graph transformations

  • Graph-Grammars And Graph-Languages
  • Conference paper
  • First Online:

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

Abstract

Parallelism of graph transformations for distributed state graphs is studied in the framework of the algebraic theory of graph grammars. The distributed parallelism theorem provides a bijective correspondence between distributed local derivations and parallel derivations of corresponding global states. This result holds for strict interface preserving derivations while in general distributed derivations are not reducible to global state derivations.

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. P. Boehm, H. Ehrig, U. Hummert, M. Löwe: Towards Distributed Graph Grammars, Proc. 3rd Int. Workshop on Graph Grammars, to appear in LNCS, 1987

    Google Scholar 

  2. E.K. Blum, H. Ehrig, F. Parisi-Presicce: Algebraic Specification of Modules and Their Basic Interconnection, JCSS vol 34 (1987), pp. 293–339

    Google Scholar 

  3. P. Boehm, H.-R. Fonio, A. Habel: Amalgamation of Graph Transformations: A Synchronization Mechanism, JCSS vol 34 (1987), pp. 377–408

    Google Scholar 

  4. I. Castellani, U. Montanari: Graph Grammars for Distributed Systems, LNCS 153, pp. 20–38 (1983)

    Google Scholar 

  5. H. Ehrig, A. Habel: Graph Grammars with Application Conditions, in: The Book of L (eds. Rozenberg-Salomaa) Springer Verlag, pp. 87–100 (1985)

    Google Scholar 

  6. H. Ehrig: Introduction to the Algebraic Theory of Graph Grammars, LNCS 73 (1979), pp. 1–69

    Google Scholar 

  7. —: Tutorial Introduction to the Algebraic Approach of Graph Grammars, Proc. 3rd Int. Workshop on Graph Grammars, to appear in LNCS, 1987

    Google Scholar 

  8. Engels, Lewerentz, Schäfer: Graph Grammar Engineering: A Software Specification Method, Proc. 3rd Ind. Workshop on Graph Grammars, to appear in LNCS, 1987

    Google Scholar 

  9. H. Ehrig, H.-J. Kreowski: Parallel Graph Grammars, in Automata, Languages, Development (eds. Lindenmayer, Rozenberg), North Holland, Publ. Comp. 1976, pp. 425–442

    Google Scholar 

  10. —: Applications of Graph Grammar Theory to Consistency, Synchronization and Scheduling in Data Base Systems, Inform. Syst., vol 5 (1980), pp.225–238

    Article  Google Scholar 

  11. H.-J. Kreowski: Anwendungen der algebraischen Graphentheorie auf Konsistenz und Synchronisation in Datenbanksystemen, Techn. Report, TU Berlin, No. 78-15, 1978

    Google Scholar 

  12. H.-J. Kreowski, A. Wilharm: Is Parallelism already Concurrency? — Part 2: Non-sequential Processes in Graph Grammars, Proc. 3rd Int. Workshop on Graph Grammars, to appear in LNCS, 1987

    Google Scholar 

  13. M. Nagl: A Tutorial and Bibliographical Survey on Graph Grammars, LNCS 73 (1979), pp. 70–126

    Google Scholar 

  14. D.L. Parnas: A Technique for Software Module Specification with Examples. Comm. ACM 15, No 5 (1972), pp. 330–336

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Herbert Göttler Hana-Jürgen Schneider

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ehrig, H., Boehm, P., Hummert, U., Löwe, M. (1988). Distributed parallelism of graph transformations. In: Göttler, H., Schneider, HJ. (eds) Graph-Theoretic Concepts in Computer Science. WG 1987. Lecture Notes in Computer Science, vol 314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19422-3_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-19422-3_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics