{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:26:54Z","timestamp":1725470814336},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336539"},{"type":"electronic","value":"9783642336546"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33654-6_26","type":"book-chapter","created":{"date-parts":[[2012,9,17]],"date-time":"2012-09-17T23:47:41Z","timestamp":1347925661000},"page":"386-400","source":"Crossref","is-referenced-by-count":8,"title":["Incremental Pattern Matching for the Efficient Computation of Transitive Closure"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"Bergmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Istv\u00e1n","family":"R\u00e1th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Szab\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Torrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00e1niel","family":"Varr\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-540-87405-8_27","volume-title":"Graph Transformations","author":"G. Bergmann","year":"2008","unstructured":"Bergmann, G., Horv\u00e1th, \u00c1., R\u00e1th, I., Varr\u00f3, 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.\u00a05214, pp. 396\u2013410. Springer, Heidelberg (2008)"},{"key":"26_CR2","unstructured":"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"},{"key":"26_CR3","unstructured":"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)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10270-009-0120-9","volume":"9","author":"N. Anquetil","year":"2010","unstructured":"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\u00a09, 427\u2013451 (2010), doi:10.1007\/s10270-009-0120-9","journal-title":"Software and Systems Modeling"},{"key":"26_CR5","unstructured":"Kov\u00e1cs, M., G\u00f6nczy, L., Varr\u00f3, D.: Formal analysis of bpel workflows with compensation by model checking. International Journal of Computer Systems and Engineering 23(5) (2008)"},{"issue":"3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.scico.2007.05.004","volume":"68","author":"D. Varr\u00f3","year":"2007","unstructured":"Varr\u00f3, D., Balogh, A.: The model transformation language of the VIATRA2 framework. Sci. Comput. Program.\u00a068(3), 214\u2013234 (2007)","journal-title":"Sci. Comput. Program."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Madari, I., Lengyel, L., Mezei, G.: Incremental model synchronization by bi-directional model transformations. In: IEEE International Conference on Computational Cybernetics, ICCC 2008, pp. 215\u2013218. IEEE (2008)","DOI":"10.1109\/ICCCYB.2008.4721408"},{"key":"26_CR8","unstructured":"Torrini, P., Heckel, R., R\u00e1th, I., Bergmann, G.: Stochastic graph transformation with regions. ECEASST 29 (2010)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10009-010-0149-7","volume":"12","author":"\u00c1. Horv\u00e1th","year":"2010","unstructured":"Horv\u00e1th, \u00c1., Bergmann, G., R\u00e1th, I., Varr\u00f3, D.: Experimental assessment of combining pattern matching strategies with VIATRA2. International Journal on Software Tools for Technology Transfer (STTT)\u00a012, 211\u2013230 (2010), doi:10.1007\/s10009-010-0149-7","journal-title":"International Journal on Software Tools for Technology Transfer (STTT)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-16145-2_6","volume-title":"Model Driven Engineering Languages and Systems","author":"G. Bergmann","year":"2010","unstructured":"Bergmann, G., Horv\u00e1th, \u00c1., R\u00e1th, I., Varr\u00f3, D., Balogh, A., Balogh, Z., \u00d6kr\u00f6s, A.: Incremental Evaluation of Model Queries over EMF Models. In: Petriu, D.C., Rouquette, N., Haugen, \u00d8. (eds.) MODELS 2010, Part I. LNCS, vol.\u00a06394, pp. 76\u201390. Springer, Heidelberg (2010)"},{"key":"26_CR11","unstructured":"Proctor, M., et al.: Drools Documentation. JBoss, \n                    \n                      http:\/\/labs.jboss.com\/drools\/documentation.html"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/3-540-19422-3_9","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J.A. Poutr\u00e9 La","year":"1988","unstructured":"La Poutr\u00e9, J.A., van Leeuwen, J.: Maintenance of Transitive Closures and Transitive Reductions of Graphs. In: G\u00f6ttler, H., Schneider, H.-J. (eds.) WG 1987. LNCS, vol.\u00a0314, pp. 106\u2013120. Springer, Heidelberg (1988)"},{"key":"26_CR13","first-page":"2001","volume":"6","author":"D. Frigioni","year":"2000","unstructured":"Frigioni, D., Miller, T., Nanni, U., Zaroliagis, C.: An experimental study of dynamic algorithms for transitive closure. ACM Journal of Experimental Algorithmics\u00a06, 2001 (2000)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-12029-9_11","volume-title":"Fundamental Approaches to Software Engineering","author":"P. Torrini","year":"2010","unstructured":"Torrini, P., Heckel, R., R\u00e1th, I.: Stochastic Simulation of Graph Transformation Systems. In: Rosenblum, D.S., Taentzer, G. (eds.) FASE 2010. LNCS, vol.\u00a06013, pp. 154\u2013157. Springer, Heidelberg (2010)"},{"key":"26_CR15","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of algebraic graph transformation. Springer (2006)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-13568-2_15","volume-title":"Analytical and Stochastic Modeling Techniques and Applications","author":"A. Khan","year":"2010","unstructured":"Khan, A., Heckel, R., Torrini, P., R\u00e1th, 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.\u00a06148, pp. 204\u2013217. Springer, Heidelberg (2010)"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Varr\u00f3, G., Varr\u00f3, D.: Graph transformation with incremental updates. In: Proc. GT-VMT 2004, International Workshop on Graph Transformation and Visual Modelling Techniques. ENTCS, vol.\u00a0109, pp. 71\u201383. Elsevier (2004)","DOI":"10.1016\/j.entcs.2004.02.057"},{"key":"26_CR18","unstructured":"Varr\u00f3, G., Varr\u00f3, D., Sch\u00fcrr, A.: Incremental Graph Pattern Matching: Data Structures and Initial Experiments. In: Graph and Model Transformation (GraMoT 2006). Electronic Communications of the EASST, vol.\u00a04. EASST (2006)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/11880240_23","volume-title":"Model Driven Engineering Languages and Systems","author":"D. Hearnden","year":"2006","unstructured":"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.\u00a04199, pp. 321\u2013335. Springer, Heidelberg (2006)"},{"issue":"1","key":"26_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0004-3702(82)90020-0","volume":"19","author":"C.L. Forgy","year":"1982","unstructured":"Forgy, C.L.: Rete: A fast algorithm for the many pattern\/many object pattern match problem. Artificial Intelligence\u00a019(1), 17\u201337 (1982)","journal-title":"Artificial Intelligence"},{"key":"26_CR21","unstructured":"Torrini, P., R\u00e1th, I.: GraTS: graph transformation-based stochastic simulation \u2014 Documentation (2012), \n                    \n                      http:\/\/viatra.inf.mit.bme.hu\/grats"},{"key":"26_CR22","unstructured":"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.\u00a016 (2009), \n                    \n                      http:\/\/eceasst.cs.tu-berlin.de\/index.php\/eceasst\/issue\/view\/26"},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.entcs.2007.04.018","volume":"175","author":"P. Kosiuczenko","year":"2007","unstructured":"Kosiuczenko, P., Lajios, G.: Simulation of generalised semi-Markov processes based on graph transformation systems. Electronic Notes in Theoretical Computer Science\u00a0175, 73\u201386 (2007)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Cassandras, C.G., Lafortune, S.: Introduction to discrete event systems. Kluwer (2008)","DOI":"10.1007\/978-0-387-68612-7"},{"issue":"1","key":"26_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2005.07.001","volume":"203","author":"P.R. D\u2019Argenio","year":"2005","unstructured":"D\u2019Argenio, P.R., Katoen, J.P.: A theory of stochastic systems part I: Stochastic automata. Inf. Comput.\u00a0203(1), 1\u201338 (2005)","journal-title":"Inf. Comput."},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"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\u2013166. ACM (1993)","DOI":"10.1145\/170036.170066"},{"issue":"2","key":"26_CR27","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR28","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.jda.2005.12.003","volume":"4","author":"C. Demetrescu","year":"2006","unstructured":"Demetrescu, C., Italiano, G.F.: Dynamic shortest paths and transitive closure: algorithmic techniques and data structures. J. Discr. Algor.\u00a04, 353\u2013383 (2006)","journal-title":"J. Discr. Algor."},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-52292-1_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A. Sch\u00fcrr","year":"1990","unstructured":"Sch\u00fcrr, A.: Introduction to PROGRES, an Attributed Graph Grammar Based Specification Language. In: Nagl, M. (ed.) WG 1989. LNCS, vol.\u00a0411, pp. 151\u2013165. Springer, Heidelberg (1990)"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Nickel, U., Niere, J., Z\u00fcndorf, A.: Tool demonstration: The FUJABA environment. In: The 22nd International Conference on Software Engineering (ICSE), Limerick, Ireland. ACM Press (2000)","DOI":"10.1145\/337180.337620"},{"key":"26_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-13688-7_9","volume-title":"Theory and Practice of Model Transformations","author":"F. Jouault","year":"2010","unstructured":"Jouault, F., Tisi, M.: Towards Incremental Execution of ATL Transformations. In: Tratt, L., Gogolla, M. (eds.) ICMT 2010. LNCS, vol.\u00a06142, pp. 123\u2013137. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33654-6_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:17:52Z","timestamp":1620116272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33654-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336539","9783642336546"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33654-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}