{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:48Z","timestamp":1725566148077},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642159275"},{"type":"electronic","value":"9783642159282"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15928-2_27","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T14:32:34Z","timestamp":1284993154000},"page":"384-387","source":"Crossref","is-referenced-by-count":4,"title":["Recognizable Graph Languages for the Verification of Dynamic Systems"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Blume","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Andersen, H.R.: An introduction to binary decision diagrams. Course Notes (1997)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner Verlag (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"27_CR3","unstructured":"Blume, C.: Graphsprachen f\u00fcr die Spezifikation von Invarianten bei verteilten und dynamischen Systemen. Master\u2019s thesis, Universit\u00e4t Duisburg-Essen (2008)"},{"key":"27_CR4","unstructured":"Blume, C., Bruggink, S., K\u00f6nig, B.: Recognizable graph languages for checking invariants. In: Proc. of GT-VMT 2010. Elec. Communications of the EASST (2010)"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11823230_5","volume-title":"Static Analysis","author":"A. Bouajjani","year":"2006","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular tree model checking of complex dynamic data structures. In: Yi, K. (ed.) SAS 2006. LNCS, vol.\u00a04134, pp. 52\u201370. Springer, Heidelberg (2006)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_31","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2000","unstructured":"Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855. Springer, Heidelberg (2000)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Bozapalidis, S., Kalampakas, A.: Graph automata. Theor. Comp. Sci.\u00a0393 (2008)","DOI":"10.1016\/j.tcs.2007.11.022"},{"key":"27_CR8","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":"S. Bruggink","year":"2008","unstructured":"Bruggink, 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.\u00a05214, pp. 336\u2013350. Springer, Heidelberg (2008)"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-45319-9_22","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Cimatti","year":"2001","unstructured":"Cimatti, A., Roveri, M., Bertoli, P.: Searching powerset automata by combining explicit-state and symbolic model checking. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, p. 313. Springer, Heidelberg (2001)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Inf. Comput.\u00a085(1) (1990)","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"27_CR11","series-title":"Foundations","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, ch. 5","author":"B. Courcelle","year":"1997","unstructured":"Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Handbook of Graph Grammars and Computing by Graph Transformation, ch. 5. Foundations, vol.\u00a01. World Scientific, Singapore (1997)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"de Luca, A., Varricchio, S.: Well quasi-orders and regular languages. Acta Inf.\u00a031(6) (1994)","DOI":"10.1007\/BF01213206"},{"key":"27_CR13","unstructured":"Sassone, V., Soboci\u0144ski, P.: Reactive systems over cospans. In: LICS (2005)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15928-2_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:46Z","timestamp":1606185766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15928-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159275","9783642159282"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15928-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}