Skip to main content
SpringerLink
Log in
Book cover

Informatik zwischen Wissenschaft und Gesellschaft pp 47–65Cite as

From Parallel to Distributed Derivations of Graphs in the Single-Pushout-Approach

  • Conference paper

  • 96 Accesses

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 309))

Abstract

Parallel and distributed graph derivations are introduced and studied in the algebraic approach to graph grammars based on single pushout derivations. The relationship between parallel and distributed derivations is given in the parallel derivation theorem and the hierarchy theorem for distributed derivations.

The basis for distribution is a splitting of global graphs into local components with constant or dynamic interfaces for local derivations. In the case of dynamic interfaces direct distributed derivations are in bijectivc correspondence with direct amalgamated derivations based on the amalgamation of local rules.

The algebraic approach to graph grammars is shown to be useful to model local and global components of states and operations in distributed systems. As an example we present the kernel of a database which can be seen as a very abstract model of the information processing system INPOL of the German police. Finally we discuss the difference between the classical algebraic approach based on double pushouts and the more recent algebraic approach based on single pushouts which is used in this paper.

This work has been partly supported by the ESPRIT Basic Research Working Group No. 3299 “Computing by Graph Transformation (GRA2)”.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Boehm, H. Fonio, A. Habel: Amalgamation of Graph Transformation: A Synchronization Mechanisms, in: JCSS 34, 307–408 (1987).

    Google Scholar 

  2. P. Degano, U. Montanari: A Model of Distributed Systems Based on Graph Rewriting, in: Journal of the ACM 34 (2), 411–449 (1987).

    Google Scholar 

  3. H. Ehrig, P. Boehm, U. Hummert, M. Löwe: Distributed Parallelism of Graph Transformations, in: Graph- Theoretical Concepts in Computer Science WG’87, Springer, LNCS 314,1–19 (1988).

    Google Scholar 

  4. H. Ehrig, A. Habel: Graph Grammars with Application Conditions, in: G. Rozenbcrg, A. Salomaa (eds.): The Book of L, Springer, 87–100 (1985).

    Google Scholar 

  5. H. Ehrig, A. Habel, H.-J. Kreowski, F. Parisi-Presicce: From Graph Grammars to High-level Replacement Systems, to appear in Proceedings of the Fourth International Workshop on Graph Grammars and Their Application to Computer Science, Bremen, March 1990.

    Google Scholar 

  6. H. Ehrig, H.-J. Kreowski, A. Maggiolo-Schettini, B.K. Rosen, J. Winkowski: Transformations of Structures: An Algebraic Approach. Mathematical Systems Theory 14, pp. 305–334.

    Google Scholar 

  7. H. Ehrig: Introduction to the Algebraic Theory of Graph Grammars (a Survey), in: Graph Grammars and Their Application to Computer Science and Biology, Springer, LNCS 73,1–69 (1979).

    Chapter  Google Scholar 

  8. H. Ehrig, M. Löwe: Parallel and Distributed Derivations in the Single-Pushout-Approach; Techn. Report No. 91-01, TU Berlin, FB 20,1991.

    Google Scholar 

  9. H. Ehrig, B. K. Rosen: Concurrency of Manipulations in Multi-dimensional Information Structures, Techn. Report No. 78–13, TU Berlin, FB 20,1978

    Google Scholar 

  10. R. Franck: A Class of Linearly Parsable Graph Grammars. Acta Informatica 10,175–201, Springer, Berlin, 1978.

    Google Scholar 

  11. A. Habel: Hypcrcdge Replacement: Grammars and Languages, Dissertation, University Bremen (1989).

    Google Scholar 

  12. B. Hoffmann, D. Plump: Jungle Evaluation for Efficient Term Rewriting, in: Algebraic and Logic Programming, Akademie Verlag, Berlin (DDR), 191–203 (1988).

    Google Scholar 

  13. R. Kennaway: On “On Graph Rewriting”, in: Theoretical Computer Science 52, 37–58 (1987).

    Google Scholar 

  14. H.-J. Kreowski, A. Wilharm: Is Parallelism already concurrency? Part 2: Non-sequential Processes in Graph Grammars, in: Graph Grammars and Their Application to Computer Science, Springer, LNCS 291, 361–377 (1987).

    Google Scholar 

  15. M. Löwe, H. Ehrig: Algebraic Approach to Graph Transformation Based on Single Pushout Derivations. In: 16th Intern. Workshop on Graph Theoretic Concepts in Computer Science (WG’90) (Rolf H. Möhring, ed.) Springer Lecture Notes in Computer Science, to appear, 16 pages.

    Google Scholar 

  16. M. Löwe: Exrtcnded Algebraic Graph Transformation, PhD Thesis, Technical University of Berlin (1990).

    Google Scholar 

  17. M. Löwe, R. Wilhelm: Risiken polizeilicher Datenverarbeitung, in: Schöne neue Computerwelt, Verlag für Studium und Ausbildung in der Elefanten Press, Berlin, 216–252 (1988).

    Google Scholar 

  18. P. Padawitz: Graph Grammars and Operational Semantics, in: Theoretical Computer Science 19, 37–58 (1982).

    Google Scholar 

  19. F. Parisi-Presicce: Modular System Design Applying Graph Grammars Techniques, in: ICALF89, Springer, LNCS 372 (1989).

    Google Scholar 

  20. J.C. Raoult: On Graph Rewriting, in: Theoretical Computer Science 32,1–24 (1984).

    Google Scholar 

  21. G. Rozenberg: An Introduction to the NLC way of rewriting graphs, in: Graph Grammars and Their Application to Computer Science, Springer, LNCS 291,55–66 (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Technische Universität Berlin, Sekr. FR 6-1, Franklinstraße 28/29, W-1000, Berlin 10, Deutschland

    H. Ehrig & M. Löwe

Authors
  1. H. Ehrig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Löwe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich Mathematik und Informatik, Universität Bremen, Bibliothekstraße, Postfach 330 440, W-2800, Bremen 33, Deutschland

    Hans-Jörg Kreowski

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ehrig, H., Löwe, M. (1992). From Parallel to Distributed Derivations of Graphs in the Single-Pushout-Approach. In: Kreowski, HJ. (eds) Informatik zwischen Wissenschaft und Gesellschaft. Informatik-Fachberichte, vol 309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77449-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-77449-2_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55389-2

  • Online ISBN: 978-3-642-77449-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation