{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:08:34Z","timestamp":1742972914894,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319211442"},{"type":"electronic","value":"9783319211459"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21145-9_8","type":"book-chapter","created":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T10:55:04Z","timestamp":1437044104000},"page":"121-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reachability in Graph Transformation Systems and Slice Languages"],"prefix":"10.1007","author":[{"given":"Mateus","family":"de Oliveira Oliveira","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,17]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6423(98)00023-9","volume":"34","author":"M Andries","year":"1999","unstructured":"Andries, M., Engels, G., Habel, A., Hoffmann, B., Kreowski, H.-J., Kuske, S., Plump, D., Sch\u00fcrr, A., Taentzer, G.: Graph transformation for specification and programming. Sci. Comput. Program. 34(1), 1\u201354 (1999)","journal-title":"Sci. Comput. Program."},{"issue":"7","key":"8_CR2","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/j.ic.2008.04.002","volume":"206","author":"P Baldan","year":"2008","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: A framework for the verification of infinite-state graph transformation systems. Inf. Comput. 206(7), 869\u2013907 (2008)","journal-title":"Inf. Comput."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-30203-2_30","volume-title":"Graph Transformations","author":"L Baresi","year":"2004","unstructured":"Baresi, L., Heckel, R.: Tutorial introduction to graph transformation: a software engineering perspective. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 431\u2013433. Springer, Heidelberg (2004)"},{"issue":"2\u20133","key":"8_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M Bauderon","year":"1987","unstructured":"Bauderon, M., Courcelle, B.: Graph expressions and graph rewritings. Math. Syst. Theory 20(2\u20133), 83\u2013127 (1987)","journal-title":"Math. Syst. Theory"},{"key":"8_CR5","unstructured":"Bertrand, N., Delzanno, G., K\u00f6nig, B., Sangnier, A., St\u00fcckrath, J.: On the decidability status of reachability and coverability in graph transformation systems. In: Rewriting Techniques and Applications, vol. 12, pp. 101\u2013116 (2012)"},{"issue":"1\u20133","key":"8_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.tcs.2004.09.040","volume":"332","author":"F-J Brandenburg","year":"2005","unstructured":"Brandenburg, F.-J., Skodinis, K.: Finite graph automata for linear and boundary graph languages. Theor. Comput. Sci. 332(1\u20133), 199\u2013232 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-87405-8_23","volume-title":"Graph Transformations","author":"HS Bruggink","year":"2008","unstructured":"Bruggink, H.S., K\u00f6nig, B.: On the recognizability of arrow and graph languages. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 336\u2013350. Springer, Heidelberg (2008)"},{"issue":"3","key":"8_CR8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","volume":"26","author":"A Corradini","year":"1996","unstructured":"Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae 26(3), 241\u2013265 (1996)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"8_CR9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.3233\/FI-2010-367","volume":"105","author":"M de Oliveira Oliveira","year":"2010","unstructured":"de Oliveira Oliveira, M.: Hasse diagram generators and petri nets. Fundamenta Informaticae 105(3), 263\u2013289 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-28332-1_38","volume-title":"Language and Automata Theory and Applications","author":"M de Oliveira Oliveira","year":"2012","unstructured":"de Oliveira Oliveira, M.: Canonizable partial order generators. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 445\u2013457. Springer, Heidelberg (2012)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-03898-8_12","volume-title":"Parameterized and Exact Computation","author":"M de Oliveira Oliveira","year":"2013","unstructured":"de Oliveira Oliveira, M.: Subgraphs satisfying MSO properties on z-topologically orderable digraphs. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 123\u2013136. Springer, Heidelberg (2013)"},{"key":"8_CR12","unstructured":"Downey, R.G., Fellows, M.R.: Fixed parameter tractability and completeness. In: Complexity Theory: Current Research, pp. 191\u2013225 (1992)"},{"key":"8_CR13","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","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. An EATCS Series. Springer, Berlin (2006)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M., Schneider, H.J.: Graph-grammars: an algebraic approach. In: Switching and Automata Theory, pp. 167\u2013180. IEEE Computer Society (1973)","DOI":"10.1109\/SWAT.1973.11"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(80)90016-X","volume":"11","author":"H Ehrig","year":"1980","unstructured":"Ehrig, H., Rosen, B.K.: Parallelism and concurrency of graph manipulations. Theoret. Comput. Sci. 11(3), 247\u2013275 (1980)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s002360050106","volume":"34","author":"J Engelfriet","year":"1997","unstructured":"Engelfriet, J., Vereijken, J.J.: Context-free graph grammars and concatenation of graphs. Acta Informatica 34, 773\u2013803 (1997)","journal-title":"Acta Informatica"},{"key":"8_CR17","first-page":"1","volume":"61","author":"CM Poskitt","year":"2013","unstructured":"Poskitt, C.M., Plump, D.: Verifying total correctness of graph programs. Electron. Commun. EASST 61, 1\u201320 (2013)","journal-title":"Electron. Commun. EASST"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-68679-8_8","volume-title":"Concurrency, Graphs and Models","author":"A Rensink","year":"2008","unstructured":"Rensink, A.: Explicit state model checking for graph grammars. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 114\u2013132. Springer, Heidelberg (2008)"},{"key":"8_CR19","volume-title":"Handbook of graph grammars and computing by graph transformation","author":"G Rozenberg","year":"1999","unstructured":"Rozenberg, G., Ehrig, H.: Handbook of graph grammars and computing by graph transformation, vol. 1. World Scientific Publishing, Singapore (1999)"},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.12.001","volume":"56","author":"DM Thilikos","year":"2005","unstructured":"Thilikos, D.M., Serna, M., Bodlaender, H.L.: Cutwidth I: a linear time fixed parameter algorithm. J. Algorithms 56(1), 1\u201324 (2005)","journal-title":"J. Algorithms"},{"key":"8_CR21","first-page":"147","volume":"176","author":"W Thomas","year":"1992","unstructured":"Thomas, W.: Finite-state recognizability of graph properties. Theorie des Automates et Applications 176, 147\u2013159 (1992)","journal-title":"Theorie des Automates et Applications"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21145-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:39:45Z","timestamp":1676972385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21145-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319211442","9783319211459"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21145-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}