{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T05:13:40Z","timestamp":1771046020018,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319682693","type":"print"},{"value":"9783319682709","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68270-9_10","type":"book-chapter","created":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T07:17:19Z","timestamp":1506410239000},"page":"191-213","source":"Crossref","is-referenced-by-count":2,"title":["How Much Are Your Geraniums? Taking Graph Conditions Beyond First Order"],"prefix":"10.1007","author":[{"given":"Arend","family":"Rensink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"10_CR1","unstructured":"Andersen, J.L., Flamm, C., Merkle, D., Stadler, P.F.: Inferring chemical reaction patterns using rule composition in graph grammars. CoRR abs\/1208.3153 (2012). http:\/\/arxiv.org\/abs\/1208.3153"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-16145-2_9","volume-title":"Model Driven Engineering Languages and Systems","author":"T Arendt","year":"2010","unstructured":"Arendt, T., Biermann, E., Jurack, S., Krause, C., Taentzer, G.: Henshin: advanced concepts and tools for in-place EMF model transformations. In: Petriu, D.C., Rouquette, N., Haugen, \u00d8. (eds.) MODELS 2010. LNCS, vol. 6394, pp. 121\u2013135. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-16145-2_9"},{"key":"10_CR3","unstructured":"Balasubramanian, D., Narayanan, A., Neema, S., Shi, F., Thibodeaux, R., Karsai, G.: A subgraph operator for graph transformation languages. In: Ehrig and Giese [9]. http:\/\/journal.ub.tu-berlin.de\/index.php\/eceasst\/article\/view\/72"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Balogh, A., Varr\u00f3, D.: Advanced model transformation language constructs in the VIATRA2 framework. In: Haddad, H. (ed.) Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), pp. 1280\u20131287. ACM (2006)","DOI":"10.1145\/1141277.1141575"},{"key":"10_CR5","series-title":"Monographs in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31188-2","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. Springer, Heidelberg (2006). doi: 10.1007\/3-540-31188-2"},{"issue":"1","key":"10_CR6","first-page":"135","volume":"74","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.: Theory of constraints and application conditions: from graphs to high-level structures. Fundam. Inform. 74(1), 135\u2013166 (2006). http:\/\/content.iospress.com\/articles\/fundamenta-informaticae\/fi74-1-07","journal-title":"Fundam. Inform."},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification, Part I and II. Monographs in Theoretical Computer Science. An EATCS Series, vols. 6 and 21. Springer, Heidelberg (1985, 1990). doi: 10.1007\/978-3-642-69962-7 , doi: 10.1007\/978-3-642-61284-8","DOI":"10.1007\/978-3-642-69962-7"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M., Schneider, H.J.: Graph-grammars: an algebraic approach. In: Symposium on Switching and Automata Theory, pp. 167\u2013180. IEEE Computer Society (1973). https:\/\/doi.org\/10.1109\/SWAT.1973.11","DOI":"10.1109\/SWAT.1973.11"},{"key":"10_CR9","unstructured":"Ehrig, K., Giese, H. (eds.): Graph Transformation and Visual Modeling Techniques (GT-VMT). Electronic Communications of the EASST, vol. 6 (2007)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-540-89020-1_30","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"C Fuss","year":"2008","unstructured":"Fuss, C., Tuttlies, V.E.: Simulating set-valued transformations with algorithmic graph transformation languages. In: Sch\u00fcrr, A., Nagl, M., Z\u00fcndorf, A. (eds.) AGTIVE 2007. LNCS, vol. 5088, pp. 442\u2013455. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-89020-1_30"},{"issue":"1","key":"10_CR11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10009-011-0186-x","volume":"14","author":"AH Ghamarian","year":"2012","unstructured":"Ghamarian, A.H., de Mol, M., Rensink, A., Zambon, E., Zimakova, M.: Modelling and analysis using GROOVE. STTT 14(1), 15\u201340 (2012)","journal-title":"STTT"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-15928-2_23","volume-title":"Graph Transformations","author":"U Golas","year":"2010","unstructured":"Golas, U., Ehrig, H., Habel, A.: Multi-amalgamation in adhesive categories. In: Ehrig, H., Rensink, A., Rozenberg, G., Sch\u00fcrr, A. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 346\u2013361. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15928-2_23"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10270-011-0190-3","volume":"12","author":"R Gr\u00f8nmo","year":"2013","unstructured":"Gr\u00f8nmo, R., Krogdahl, S., M\u00f8ller-Pedersen, B.: A collection operator for graph transformation. Softw. Syst. Model. 12(1), 121\u2013144 (2013). doi: 10.1007\/s10270-011-0190-3","journal-title":"Softw. Syst. Model."},{"issue":"3\/4","key":"10_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.3233\/FI-1996-263404","volume":"26","author":"A Habel","year":"1996","unstructured":"Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundam. Inform. 26(3\/4), 287\u2013313 (1996). doi: 10.3233\/FI-1996-263404","journal-title":"Fundam. Inform."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Hoffmann, B., Janssens, D., Eetvelde, N.V.: Cloning and expanding graph transformation rules for refactoring. In: Karsai, G., Taentzer, G. (eds.) Graph and Model Transformation (GraMoT). Electronic Notes in Theoretical Computer Science, vol. 152, pp. 53\u201367 (2006). https:\/\/doi.org\/10.1016\/j.entcs.2006.01.014","DOI":"10.1016\/j.entcs.2006.01.014"},{"issue":"4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s00165-016-0412-0","volume":"29","author":"S Junges","year":"2017","unstructured":"Junges, S., Guck, D., Katoen, J., Rensink, A., Stoelinga, M.: Fault trees on a diet: automated reduction by graph rewriting. Formal Asp. Comput. 29(4), 651\u2013703 (2017). doi: 10.1007\/s00165-016-0412-0","journal-title":"Formal Asp. Comput."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Kissinger, A., Merry, A., Soloviev, M.: Pattern graph rewrite systems. In: L\u00f6we, B., Winskel, G. (eds.) International Workshop on Developments in Computational Models. EPTCS, vol. 143, pp. 54\u201366 (2014)","DOI":"10.4204\/EPTCS.143.5"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/3-540-10291-4_22","volume-title":"Graphtheoretic Concepts in Computer Science","author":"H-J Kreowski","year":"1981","unstructured":"Kreowski, H.-J.: A comparison between petri-nets and graph grammars. In: Noltemeier, H. (ed.) WG 1980. LNCS, vol. 100, pp. 306\u2013317. Springer, Heidelberg (1981). doi: 10.1007\/3-540-10291-4_22"},{"key":"10_CR19","unstructured":"Lindqvist, J., Lundkvist, T., Porres, I.: A query language with the star operator. In: Ehrig and Giese [9]. http:\/\/journal.ub.tu-berlin.de\/index.php\/eceasst\/article\/view\/55"},{"key":"10_CR20","unstructured":"LOTOS: A formal description technique based on the temporal ordering of observational behaviour. ISO\/IEC Infernational Standard 8807, International Organization for Standardization (1989). https:\/\/www.iso.org\/standard\/16258.html"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Nickel, U., Niere, J., Z\u00fcndorf, A.: The FUJABA environment. In: Ghezzi, C., Jazayeri, M., Wolf, A.L. (eds.) 22nd International Conference on on Software Engineering (ICSE), pp. 742\u2013745. ACM (2000)","DOI":"10.1145\/337180.337620"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Plump, D.: Essentials of term graph rewriting. In: GETGRATS Closing Workshop. Electronic Notes in Theoretical Computer Science, vol. 51, pp. 277\u2013289 (2001). https:\/\/doi.org\/10.1016\/S1571-0661(04)80210-X","DOI":"10.1016\/S1571-0661(04)80210-X"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-30203-2_23","volume-title":"Graph Transformations","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: Representing first-order logic using graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319\u2013335. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30203-2_23"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11841883_1","volume-title":"Graph Transformations","author":"A Rensink","year":"2006","unstructured":"Rensink, A.: Nested quantification in graph transformation rules. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 1\u201313. Springer, Heidelberg (2006). doi: 10.1007\/11841883_1"},{"key":"10_CR25","unstructured":"Rensink, A., Kuperus, J.: Repotting the geraniums: on nested graph transformation rules. In: Boronat, A., Heckel, R. (eds.) Graph Transformation and Visual Modeling Techniques (GT-VMT). Electronic Communications of the EASST, vol. 18 (2009). http:\/\/journal.ub.tu-berlin.de\/index.php\/eceasst\/article\/view\/260"},{"issue":"1\u20132","key":"10_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(96)00215-0","volume":"186","author":"G Taentzer","year":"1997","unstructured":"Taentzer, G.: Parallel high-level replacement systems. Theor. Comput. Sci. 186(1\u20132), 43\u201381 (1997). doi: 10.1016\/S0304-3975(96)00215-0","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","ModelEd, TestEd, TrustEd"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68270-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T19:51:39Z","timestamp":1570132299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68270-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319682693","9783319682709"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68270-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}