Skip to main content
SpringerLink
Log in

From Pattern Invocation Networks to Rule Preconditions

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

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

Included in the following conference series:

  • 381 Accesses

Abstract

Incremental (graph) pattern matchers provide a suitable, high-level platform for implementing Graph Transformation (GT) engines. All incremental pattern matchers we are aware of use a similar notion of Pattern Invocation Networks (PINs) as a specification language. Leveraging an incremental pattern matcher for GT thus requires a semantics-preserving transformation from GT rules to PINs. Although graph queries have been formally related to generalised discrimination networks (a generalisation of PINs) in the literature, practical GT engines typically support only a much more restrictive form of “flat”, i.e., non-nested graph queries. We are not aware of any formalisation that relates PINs to non-nested graph queries in a way that supports verifying semantics preservation for GT-to-PIN transformations and PIN-to-PIN optimisations in a fully automated manner. In this paper, we therefore propose a formal semantics for a specific class of “flat-equivalent” PINs by providing a flattening transformation to non-nested graph queries.

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

Notes

  1. 1.

    \(\dot{\cup }\) denotes the disjoint union of sets, \(\emptyset \) the empty set.

  2. 2.

    bit.ly/2VUWwjM.

  3. 3.

    github.com/eMoflon/pin-analysis-icgt2019.

  4. 4.

    www.drools.org.

  5. 5.

    www.emoflon.org.

References

  1. Anjorin, A., Buchmann, T., Westfechtel, B.: The families to persons case. In: TTC 2017, Marburg, Germany, 21 July 2017, pp. 27–34 (2017)

    Google Scholar 

  2. Bang, J.Y., et al.: CoDesign: a highly extensible collaborative software modeling framework. In: ICSE 2010, pp. 243–246. IEEE (2010)

    Google Scholar 

  3. Bergmann, G.: Incremental model queries in model-driven design. Ph.D. thesis, Budapest University of Technology and Economics, Budapest, October 2013. http://home.mit.bme.hu/bergmann/download/phd-thesis-bergmann.pdf. Accessed 16 Nov 2018

  4. Bergmann, G., Horváth, Á., Ráth, I., Varró, D.: A benchmark evaluation of incremental pattern matching in graph transformation. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 396–410. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87405-8_27

    Chapter  MATH  Google Scholar 

  5. Bergmann, G., Ökrös, A., Ráth, I., Varró, D., Varró, G.: Incremental pattern matching in the VIATRA model transformation system. In: GRaMoT 2008, pp. 25–32. ACM, New York (2008)

    Google Scholar 

  6. Beyhl, T., Blouin, D., Giese, H., Lambers, L.: On the operationalization of graph queries with generalized discrimination networks. In: Echahed, R., Minas, M. (eds.) ICGT 2016. LNCS, vol. 9761, pp. 170–186. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40530-8_11

    Chapter  MATH  Google Scholar 

  7. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. MTCSAES. Springer, Heidelberg (2006). https://doi.org/10.1007/3-540-31188-2

    Book  MATH  Google Scholar 

  8. Garzón, M.A., Lethbridge, T.C., Aljamaan, H., Badreddin, O.: Reverse engineering of object-oriented code into Umple using an incremental and rule-based approach. In: CASCON 2014, pp. 91–105. IBM Corp., Riverton (2014)

    Google Scholar 

  9. Golas, U., Ehrig, H., Habel, A.: Multi-amalgamation in adhesive categories. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 346–361. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15928-2_23

    Chapter  Google Scholar 

  10. Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19(2), 245–296 (2009)

    Article  MathSciNet  Google Scholar 

  11. Hanson, E.N., Bodagala, S., Chadaga, U.: Trigger condition testing and view maintenance using optimized discrimination networks. IEEE Trans. Knowl. Data Eng. 14(2), 261–280 (2002)

    Article  Google Scholar 

  12. Hébert, M.: \(\lambda \)-presentable morphisms, injectivity and (weak) factorization systems. Appl. Categ. Struct. 14(4), 273–289 (2006). https://doi.org/10.1007/s10485-006-9024-9

    Article  MathSciNet  MATH  Google Scholar 

  13. Horváth, A., Bergmann, G., Ráth, I., Varró, D.: Experimental assessment of combining pattern matching strategies with VIATRA2. Int. J. Softw. Tools Technol. Transf. 12(3–4), 211–230 (2010)

    Article  Google Scholar 

  14. Kuschke, T., Mäder, P., Rempel, P.: Recommending auto-completions for software modeling activities. In: Moreira, A., Schätz, B., Gray, J., Vallecillo, A., Clarke, P. (eds.) MODELS 2013. LNCS, vol. 8107, pp. 170–186. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41533-3_11

    Chapter  Google Scholar 

  15. Leblebici, E., Anjorin, A., Fritsche, L., Varró, G., Schürr, A.: Leveraging incremental pattern matching techniques for model synchronisation. In: de Lara, J., Plump, D. (eds.) ICGT 2017. LNCS, vol. 10373, pp. 179–195. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61470-0_11

    Chapter  Google Scholar 

  16. Leblebici, E., Anjorin, A., Schürr, A., Hildebrandt, S., Rieke, J., Greenyer, J.: A comparison of incremental triple graph grammar tools. In: ECEASST 67 (2014)

    Google Scholar 

  17. Varró, D., Bergmann, G., Hegedüs, Á., Horváth, Á., Ráth, I., Ujhelyi, Z.: Road to a reactive and incremental model transformation platform: three generations of the VIATRA framework. Softw. Syst. Model. 15(3), 609–629 (2016)

    Article  Google Scholar 

  18. Varró, G., Deckwerth, F.: A rete network construction algorithm for incremental pattern matching. In: Duddy, K., Kappel, G. (eds.) ICMT 2013. LNCS, vol. 7909, pp. 125–140. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38883-5_13

    Chapter  Google Scholar 

  19. Varró, G., Horváth, Á., Varró, D.: Recursive graph pattern matching. In: Schürr, A., Nagl, M., Zündorf, A. (eds.) AGTIVE 2007. LNCS, vol. 5088, pp. 456–470. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-89020-1_31

    Chapter  Google Scholar 

  20. Wang, S., Morin, B., Roman, D., Berre, A.J.: A semi-automatic transformation approach for semantic interoperability. In: NATO Symposium and Workshop on Semantic & Domain Based Interoperability (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Paderborn University, Paderborn, Germany

    Nils Weidmann, Anthony Anjorin & Florian Kraus

  2. itemis AG, Paderborn, Germany

    Florian Stolte

Authors
  1. Nils Weidmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anthony Anjorin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Florian Stolte
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Florian Kraus
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nils Weidmann .

Editor information

Editors and Affiliations

  1. Universidad Autónoma de Madrid, Madrid, Spain

    Esther Guerra

  2. Universitat Politècnica de Catalunya, Barcelona, Spain

    Fernando Orejas

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Weidmann, N., Anjorin, A., Stolte, F., Kraus, F. (2019). From Pattern Invocation Networks to Rule Preconditions. In: Guerra, E., Orejas, F. (eds) Graph Transformation. ICGT 2019. Lecture Notes in Computer Science(), vol 11629. Springer, Cham. https://doi.org/10.1007/978-3-030-23611-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-23611-3_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-23610-6

  • Online ISBN: 978-3-030-23611-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation