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)

Volumn 7562 LNCS, Issue , 2012, Pages 386-400

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

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY RELATIONSHIPS; EFFICIENT COMPUTATION; EXPERIMENTAL EVALUATION; GENERALIZED TRANSITIVE CLOSURES; GRAPH EDGES; GRAPH PATTERN MATCHING; GRAPH PATTERNS; GRAPH TRANSFORMATION; INCREMENTAL COMPUTATION; KEY TECHNOLOGIES; MATCHING TECHNIQUES; MODEL SIMULATION; MODEL SYNCHRONIZATION; MODELING PROBLEMS; MULTIPLE ALGORITHMS; ON-THE-FLY; PROTOTYPICAL IMPLEMENTATION; REACHABILITY; SEARCH-BASED; STATE SPACE; TRANSFORMATION RULES; TRANSITIVE CLOSURE; VIEW MAINTENANCE; WIDE SPECTRUM;

GRAPH THEORY; MODEL CHECKING; PATTERN MATCHING;

COMPUTATIONAL EFFICIENCY;

EID: 84867649773     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33654-6_26     Document Type: Conference Paper

References (31)

1. 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)
2. Ghamarian, A.H., Jalali, A., Rensink, A.: Incremental pattern matching in graph-based state space exploration. Electronic Communications of the EASST (2010), GraBaTs 2010, Enschede
3. Jalali, A., Ghamarian, A.H., Rensink, A.: Incremental pattern matching for regular expressions. In: 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2012) (2012)
4. Anquetil, N., Kulesza, U., Mitschke, R., Moreira, A., Royer, J.C., Rummler, A., Sousa, A.: A model-driven traceability framework for software product lines. Software and Systems Modeling 9, 427-451 (2010), doi:10.1007/s10270-009-0120-9
5. Kovács, M., Gönczy, L., Varró, D.: Formal analysis of bpel workflows with compensation by model checking. International Journal of Computer Systems and Engineering 23(5) (2008)
6. Varró, D., Balogh, A.: The model transformation language of the VIATRA2 framework. Sci. Comput. Program. 68(3), 214-234 (2007)
7. Madari, I., Lengyel, L., Mezei, G.: Incremental model synchronization by bidirectional model transformations. In: IEEE International Conference on Computational Cybernetics, ICCC 2008, pp. 215-218. IEEE (2008)
8. Torrini, P., Heckel, R., Ráth, I., Bergmann, G.: Stochastic graph transformation with regions. ECEASST 29 (2010)
9. Horváth, Á., Bergmann, G., Ráth, I., Varró, D.: Experimental assessment of combining pattern matching strategies with VIATRA2. International Journal on Software Tools for Technology Transfer (STTT) 12, 211-230 (2010), doi:10.1007/s10009-010-0149-7
10. Bergmann, G., Horváth, Á., Ráth, I., Varró, D., Balogh, A., Balogh, Z., Ökrös, A.: Incremental Evaluation of Model Queries over EMF Models. In: Petriu, D.C., Rouquette, N., Haugen, Ø. (eds.) MODELS 2010, Part I. LNCS, vol. 6394, pp. 76-90. Springer, Heidelberg (2010)
11. Proctor, M., et al.: Drools Documentation. JBoss, http://labs.jboss.com/ drools/documentation.html
12. La Poutré, J.A., van Leeuwen, J.: Maintenance of Transitive Closures and Transitive Reductions of Graphs. In: Göttler, H., Schneider, H.-J. (eds.) WG 1987. LNCS, vol. 314, pp. 106-120. Springer, Heidelberg (1988)
13. Frigioni, D., Miller, T., Nanni, U., Zaroliagis, C.: An experimental study of dynamic algorithms for transitive closure. ACM Journal of Experimental Algorithmics 6, 2001 (2000)
14. Torrini, P., Heckel, R., Ráth, I.: Stochastic Simulation of Graph Transformation Systems. In: Rosenblum, D.S., Taentzer, G. (eds.) FASE 2010. LNCS, vol. 6013, pp. 154-157. Springer, Heidelberg (2010)
15. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of algebraic graph transformation. Springer (2006)
16. Khan, A., Heckel, R., Torrini, P., Ráth, I.: Model-Based Stochastic Simulation of P2P VoIP Using Graph Transformation System. In: Al-Begain, K., Fiems, D., Knottenbelt, W.J. (eds.) ASMTA 2010. LNCS, vol. 6148, pp. 204-217. Springer, Heidelberg (2010)
17. Varró, G., Varró, D.: Graph transformation with incremental updates. In: Proc. GT-VMT 2004, International Workshop on Graph Transformation and Visual Modelling Techniques. ENTCS, vol. 109, pp. 71-83. Elsevier (2004)
18. Varró, G., Varró, D., Schürr, A.: Incremental Graph Pattern Matching: Data Structures and Initial Experiments. In: Graph and Model Transformation (GraMoT 2006). Electronic Communications of the EASST, vol. 4. EASST (2006)
19. Hearnden, D., Lawley, M., Raymond, K.: Incremental Model Transformation for the Evolution of Model-Driven Systems. In: Wang, J., Whittle, J., Harel, D., Reggio, G. (eds.) MoDELS 2006. LNCS, vol. 4199, pp. 321-335. Springer, Heidelberg (2006)
20. Forgy, C.L.: Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence 19(1), 17-37 (1982)
21. Torrini, P., Ráth, I.: GraTS: graph transformation-based stochastic simulation - Documentation (2012), http://viatra.inf.mit.bme.hu/grats
22. Khan, A., Torrini, P., Heckel, R.: Model-based simulation of VoIP network reconfigurations using graph transformation systems. In: Corradini, A., Tuosto, E. (eds.) Intl. Conf. on Graph Transformation (ICGT) 2008 - Doctoral Symposium. Electronic Communications of the EASST, vol. 16 (2009), http://eceasst.cs.tu- berlin.de/index.php/eceasst/issue/view/26
23. Kosiuczenko, P., Lajios, G.: Simulation of generalised semi-Markov processes based on graph transformation systems. Electronic Notes in Theoretical Computer Science 175, 73-86 (2007)
24. Cassandras, C.G., Lafortune, S.: Introduction to discrete event systems. Kluwer (2008)
25. D'Argenio, P.R., Katoen, J.P.: A theory of stochastic systems part I: Stochastic automata. Inf. Comput. 203(1), 1-38 (2005)
26. Gupta, A., Mumick, I.S., Subrahmanian, V.S.: Maintaining views incrementally (extended abstract). In: Proc. of the Int. Conf. on Management of Data, pp. 157-166. ACM (1993)
27. Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2), 146-160 (1972)
28. Demetrescu, C., Italiano, G.F.: Dynamic shortest paths and transitive closure: algorithmic techniques and data structures. J. Discr. Algor. 4, 353-383 (2006)
29. Schürr, A.: Introduction to PROGRES, an Attributed Graph Grammar Based Specification Language. In: Nagl, M. (ed.) WG 1989. LNCS, vol. 411, pp. 151-165. Springer, Heidelberg (1990)
30. Nickel, U., Niere, J., Zündorf, A.: Tool demonstration: The FUJABA environment. In: The 22nd International Conference on Software Engineering (ICSE), Limerick, Ireland. ACM Press (2000)
31. Jouault, F., Tisi, M.: Towards Incremental Execution of ATL Transformations. In: Tratt, L., Gogolla, M. (eds.) ICMT 2010. LNCS, vol. 6142, pp. 123-137. Springer, Heidelberg (2010)