Parallel Graph Transformations Supported by Replicated Complementary Graphs | SpringerLink
Skip to main content
Springer Nature Link
Log in

Parallel Graph Transformations Supported by Replicated Complementary Graphs

  • Conference paper
Adaptive and Natural Computing Algorithms (ICANNGA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6594))

Included in the following conference series:

Abstract

Graph transformations are the powerful formalism allowing describing a behavior of systems of various types. Parallel computations paradigm makes computations faster if we are able to reduce additional costs related to a communication overhead and a complexity of design of such systems. Replicated complementary graphs concept allows a parallel execution of graph transformation rules (designed for the centralized graph case) on a distributed environment. The possibility and the cost of data replication will be considered in the paper in the context of double-pushout approach.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic approaches to graph transformation - part i: Basic concepts and double pushout approach. In: [12], pp. 163–246 (1997)

    Google Scholar 

  2. Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G.: Handbook of Graph Grammars and Computing By Graph Transformation: Volume II, Applications, Languages, and Tools. World Scientific Publishing Co., River Edge (1999)

    Book  MATH  Google Scholar 

  3. Ehrig, H., Kreowski, H.-J., Montanari, U., Rozenberg, G.: Handbook of Graph Grammars and Computing By Graph Transformation: Volume III, Concurrency, Parallelism, and Distribution. World Scientific Publishing Co., River Edge (1999)

    Book  MATH  Google Scholar 

  4. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series). Springer-Verlag New York, Inc., Secaucus (2006)

    MATH  Google Scholar 

  5. Ehrig, H., Ermel, C., Hermann, F.: On the relationship of model transformations based on triple and plain graph grammars. In: GRaMoT 2008: Proceedings of the Third International Workshop on Graph and Model Transformations, New York, NY, USA, pp. 9–16 (2008)

    Google Scholar 

  6. Kotulski, L.: GRADIS – Multiagent Environment Supporting Distributed Graph Transformations. In: Bubak, M., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2008, Part III. LNCS, vol. 5103, pp. 644–653. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Kotulski, L., Sedziwy, A.: Parallel Graph Transformations With Double Pushout Grammars. In: ICAISC 2010. LNCS (LNAI), vol. 6113, pp. 280–288 (2010)

    Google Scholar 

  8. Kotulski, L., Sędziwy, A.: On the Complexity of Coordination of Parallel Graph Transformations. In: Fourth International Conference on Dependability of Computer Systems DepCoS - RELCOMEX 2009, pp. 279–289 (2009)

    Google Scholar 

  9. Kotulski, L., Sędziwy, A.: On the effective distribution of knowledge represented by complementary graphs. In: Jędrzejowicz, P., Nguyen, N.T., Howlet, R.J., Jain, L.C. (eds.) KES-AMSTA 2010. LNCS (LNAI), vol. 6070, pp. 381–390. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Kreowski, H.J., Kluske, S.: Graph Multiset Transformation as a Framework for Massive Parallel Computation. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 351–365. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Prunsinkiewicz, P., Lindenmayer, A.: The Algorithmic Beauty of Plants. Springer, New York (1990)

    Book  MATH  Google Scholar 

  12. Rozenberg, G.: Handbook of Graph Grammars and Computing By Graph Transformation: Volume I, Foundations. World Scientific Publishing Co., River Edge (1997)

    Book  MATH  Google Scholar 

  13. Sycara, K.P.: Multiagent system. AI Magazine, 79–92 (1998)

    Google Scholar 

  14. FIPA, http://www.fipa.org/

  15. FIPA ACL Specifications, http://www.fipa.org/repository/aclspecs.html

  16. JADE, http://jade.tilab.com/

  17. Retsina, http://www.cs.cmu.edu/~softagents/retsina.htm

Download references

Author information

Authors and Affiliations

  1. Institute of Automatics, AGH University of Science and Technology, al. Mickiewicza 30, 30-059, Kraków, Poland

    Leszek Kotulski & Adam Sędziwy

Authors
  1. Leszek Kotulski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adam Sędziwy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer and Information Science, University of Ljubljana, Tržaška 25, 1000, Ljubljana, Slovenia

    Andrej Dobnikar , Uroš Lotrič  & Branko Šter ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kotulski, L., Sędziwy, A. (2011). Parallel Graph Transformations Supported by Replicated Complementary Graphs. In: Dobnikar, A., Lotrič, U., Šter, B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2011. Lecture Notes in Computer Science, vol 6594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20267-4_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20267-4_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20266-7

  • Online ISBN: 978-3-642-20267-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation