Incremental pattern matching for the efficient computation of transitive closure

Gábor Bergmann, István Ráth, Tamás Szabó, Paolo Torrini, Dániel Varró

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

Pattern matching plays a central role in graph transformations as a key technology for computing local contexts in which transformation rules are to be applied. Incremental matching techniques offer a performance advantage over the search-based approach, in a number of scenarios including on-the-fly model synchronization, model simulation, view maintenance, well-formedness checking and state space traversal [1,2]. However, the incremental computation of transitive closure in graph pattern matching has started to be investigated only recently [3]. In this paper, we propose multiple algorithms for the efficient computation of generalized transitive closures. As such, our solutions are capable of computing reachability regions defined by simple graph edges as well as complex binary relationships defined by graph patterns, that may be used in a wide spectrum of modeling problems. We also report on experimental evaluation of our prototypical implementation, carried out within the context of a stochastic system simulation case study.

Original languageEnglish
Title of host publicationGraph Transformations - 6th International Conference, ICGT 2012, Proceedings
Pages386-400
Number of pages15
DOIs
Publication statusPublished - Oct 24 2012
Event6th International Conference on Graph Transformations, ICGT 2012 - Bremen, Germany
Duration: Sep 24 2012Sep 29 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7562 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th International Conference on Graph Transformations, ICGT 2012
CountryGermany
CityBremen
Period9/24/129/29/12

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Bergmann, G., Ráth, I., Szabó, T., Torrini, P., & Varró, D. (2012). Incremental pattern matching for the efficient computation of transitive closure. In Graph Transformations - 6th International Conference, ICGT 2012, Proceedings (pp. 386-400). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7562 LNCS). https://doi.org/10.1007/978-3-642-33654-6_26