Incremental pattern matching for the efficient computation of transitive closure

Gábor Bergmann, István Ráth, Tamás Szabó, Paolo Torrini, D. 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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages386-400
Number of pages15
Volume7562 LNCS
DOIs
Publication statusPublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Transitive Closure
Pattern matching
Pattern Matching
Graph Transformation
Stochastic systems
Computing
Stochastic Simulation
System Simulation
Graph in graph theory
Reachability
Simple Graph
Experimental Evaluation
Stochastic Systems
Synchronization
State Space
Maintenance
Simulation Model
Binary
Scenarios
Modeling

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7562 LNCS, 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

Incremental pattern matching for the efficient computation of transitive closure. / Bergmann, Gábor; Ráth, István; Szabó, Tamás; Torrini, Paolo; Varró, D.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7562 LNCS 2012. p. 386-400 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7562 LNCS).

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

Bergmann, G, Ráth, I, Szabó, T, Torrini, P & Varró, D 2012, Incremental pattern matching for the efficient computation of transitive closure. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7562 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7562 LNCS, pp. 386-400, 6th International Conference on Graph Transformations, ICGT 2012, Bremen, Germany, 9/24/12. https://doi.org/10.1007/978-3-642-33654-6_26
Bergmann G, Ráth I, Szabó T, Torrini P, Varró D. Incremental pattern matching for the efficient computation of transitive closure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7562 LNCS. 2012. p. 386-400. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-33654-6_26
Bergmann, Gábor ; Ráth, István ; Szabó, Tamás ; Torrini, Paolo ; Varró, D. / Incremental pattern matching for the efficient computation of transitive closure. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7562 LNCS 2012. pp. 386-400 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4d46b901ffa943eea325d7579e93804d,
title = "Incremental pattern matching for the efficient computation of transitive closure",
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.",
author = "G{\'a}bor Bergmann and Istv{\'a}n R{\'a}th and Tam{\'a}s Szab{\'o} and Paolo Torrini and D. Varr{\'o}",
year = "2012",
doi = "10.1007/978-3-642-33654-6_26",
language = "English",
isbn = "9783642336539",
volume = "7562 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "386--400",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Incremental pattern matching for the efficient computation of transitive closure

AU - Bergmann, Gábor

AU - Ráth, István

AU - Szabó, Tamás

AU - Torrini, Paolo

AU - Varró, D.

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84867649773&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867649773&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-33654-6_26

DO - 10.1007/978-3-642-33654-6_26

M3 - Conference contribution

SN - 9783642336539

VL - 7562 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 386

EP - 400

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -