Skip to main content
SpringerLink
Log in

AGREE – Algebraic Graph Rewriting with Controlled Embedding

  • Conference paper
  • First Online:
Graph Transformation (ICGT 2015)

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

Included in the following conference series:

Abstract

The several algebraic approaches to graph transformation proposed in the literature all ensure that if an item is preserved by a rule, so are its connections with the context graph where it is embedded. But there are applications in which it is desirable to specify different embeddings. For example when cloning an item, there may be a need to handle the original and the copy in different ways. We propose a conservative extension of classical algebraic approaches to graph transformation, for the case of monic matches, where rules allow one to specify how the embedding of preserved items should be carried out.

This work has been partly funded by projects CLIMT (ANR/(ANR-11-BS02-016), TGV (CNRS-INRIA-FAPERGS/(156779 and 12/0997-7)), VeriTeS (CNPq 485048/2012-4 and 309981/2014-0), PEPS égalité (CNRS).

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

References

  1. Bauderon, M., Jacquet, H.: Pullback as a generic graph rewriting mechanism. Appl. Categorical Struct. 9(1), 65–82 (2001)

    Article  MathSciNet  Google Scholar 

  2. Cockett, J., Lack, S.: Restriction categories I: categories of partial maps. Theor. Comput. Sci. 270(12), 223–259 (2002)

    Article  MathSciNet  Google Scholar 

  3. Cockett, J., Lack, S.: Restriction categories II: partial map classification. Theor. Comput. Sci. 294(12), 61–102 (2003)

    Article  MathSciNet  Google Scholar 

  4. Corradini, A., Duval, D., Echahed, R., Prost, F., Ribeiro, L.: AGREE - algebraic graph rewriting with controlled embedding. CoRR abs/1411.4597 (2014). http://arxiv.org/abs/1411.4597

  5. Corradini, A., Heindel, T., Hermann, F., König, B.: Sesqui-pushout rewriting. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 30–45. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. 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: Rozenberg [19], pp. 163–246

    Google Scholar 

  7. Drewes, F., Hoffmann, B., Janssens, D., Minas, M.: Adaptive star grammars and their languages. Theor. Comput. Sci. 411(34–36), 3090–3109 (2010)

    Article  MathSciNet  Google Scholar 

  8. Duval, D., Echahed, R., Prost, F.: Graph rewriting with polarized cloning. CoRR abs/0911.3786 (2009). http://arxiv.org/abs/0911.3786

  9. Duval, D., Echahed, R., Prost, F.: Graph transformation with focus on incident edges. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 156–171. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Duval, D., Echahed, R., Prost, F., Ribeiro, L.: Transformation of attributed structures with cloning. In: Gnesi, S., Rensink, A. (eds.) FASE 2014 (ETAPS). LNCS, vol. 8411, pp. 310–324. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  11. Echahed, R.: Inductively sequential term-graph rewrite systems. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 84–98. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation - part II: single pushout approach and comparison with double pushout approach. In: Rozenberg [19], pp. 247–312

    Google Scholar 

  13. Ehrig, H., Pfender, M., Schneider, H.J.: Graph-grammars: an algebraic approach. In: 14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, October 15–17 1973, pp. 167–180. IEEE Computer Society (1973)

    Google Scholar 

  14. Engelfriet, J., Rozenberg, G.: Node replacement graph grammars. In: Rozenberg [19], pp. 1–94

    Google Scholar 

  15. Hay, M., Miklau, G., Jensen, D., Towsley, D.F., Li, C.: Resisting structural re-identification in anonymized social networks. VLDB J. 19(6), 797–823 (2010)

    Article  Google Scholar 

  16. Löwe, M.: Algebraic approach to single-pushout graph transformation. Theor. Comput. Sci. 109(1&2), 181–224 (1993)

    Article  Google Scholar 

  17. Löwe, M.: Graph rewriting in span-categories. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 218–233. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  18. Mitchell, M., Oldham, J., Samuel, A.: Advanced Linux Programming. Landmark Series. Landmark, New Riders (2001)

    Google Scholar 

  19. Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformations. Foundations, vol. 1. World Scientific, Singapore (1997)

    Google Scholar 

Download references

Acknowledgments

We are grateful to the anonymous reviewers of former versions of this paper for the insightful and constructive criticisms.

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Pisa, Italy

    Andrea Corradini

  2. LJK - Université de Grenoble Alpes and CNRS, Grenoble, France

    Dominique Duval

  3. LIG - Université de Grenoble Alpes and CNRS, Grenoble, France

    Rachid Echahed & Frederic Prost

  4. INF - Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil

    Leila Ribeiro

Authors
  1. Andrea Corradini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dominique Duval
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rachid Echahed
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Frederic Prost
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Leila Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leila Ribeiro .

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Sapienza Università di Roma, Rome, Italy

    Francesco Parisi-Presicce

  2. Angewandte Informatik 1, Universität Bayreuth, Bayreuth, Germany

    Bernhard Westfechtel

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Corradini, A., Duval, D., Echahed, R., Prost, F., Ribeiro, L. (2015). AGREE – Algebraic Graph Rewriting with Controlled Embedding. In: Parisi-Presicce, F., Westfechtel, B. (eds) Graph Transformation. ICGT 2015. Lecture Notes in Computer Science(), vol 9151. Springer, Cham. https://doi.org/10.1007/978-3-319-21145-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21145-9_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21144-2

  • Online ISBN: 978-3-319-21145-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation