{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:51:45Z","timestamp":1725562305295},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152399"},{"type":"electronic","value":"9783642152405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15240-5_15","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T15:30:15Z","timestamp":1280935815000},"page":"197-212","source":"Crossref","is-referenced-by-count":4,"title":["A Logic on Subobjects and Recognizability"],"prefix":"10.1007","author":[{"given":"H. J. Sander","family":"Bruggink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Blume, C.: Graphsprachen f\u00fcr die Spezifikation von Invarianten bei verteilten und dynamischen Systemen. Master\u2019s thesis, Universit\u00e4t Duisburg-Essen (November 2008)"},{"key":"15_CR2","unstructured":"Blume, C., Sander Bruggink, H.J., K\u00f6nig, B.: Recognizable graph languages for checking invariants. In: Proc. of GT-VMT \u201910 (Workshop on Graph Transformation and Visual Modeling Techniques), Electronic Communications of the EASST (2010)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","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, pp. 403\u2013418. Springer, Heidelberg (2000)"},{"issue":"8\/9","key":"15_CR4","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s00236-006-0006-z","volume":"42","author":"S. Bozapalidis","year":"2006","unstructured":"Bozapalidis, S., Kalampakas, A.: Recognizability of graph and pattern languages. Acta Informatica\u00a042(8\/9), 553\u2013581 (2006)","journal-title":"Acta Informatica"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2007.11.022","volume":"393","author":"S. Bozapalidis","year":"2008","unstructured":"Bozapalidis, S., Kalampakas, A.: Graph automata. Theoretical Computer Science\u00a0393, 147\u2013165 (2008)","journal-title":"Theoretical Computer Science"},{"key":"15_CR6","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":"H.J.S. Bruggink","year":"2008","unstructured":"Bruggink, H.J.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":"15_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs\u00a0I. Recognizable sets of finite graphs. Information and Computation\u00a085, 12\u201375 (1990)","journal-title":"Information and Computation"},{"key":"15_CR8","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, ch. 5, Foundations","author":"B. Courcelle","year":"1997","unstructured":"Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, ch. 5, Foundations, vol.\u00a01, World Scientific, Singapore (1997)"},{"key":"15_CR9","unstructured":"Courcelle, B., Durand, I.: Verifying monadic second order graph properties with tree automata. In: European Lisp Symposium (May 2010)"},{"issue":"3-4","key":"15_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00200-004-0162-8","volume":"15","author":"A. Geser","year":"2004","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. Applicable Algebra in Engineering, Communication and Computing\u00a015(3-4), 149\u2013171 (2004)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"19","key":"15_CR11","first-page":"420","volume":"11","author":"G. Griffing","year":"2003","unstructured":"Griffing, G.: Composition-representative subsets. Theory and Applications of Categories\u00a011(19), 420\u2013437 (2003)","journal-title":"Theory and Applications of Categories"},{"key":"15_CR12","unstructured":"Grohe, M.: Logic, graphs and algorithms. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and Automata \u2013 History and Perspectives. Amsterdam University Press (2007)"},{"key":"15_CR13","unstructured":"Heindel, T.: A category theoretical approach to the concurrent semantics of rewriting. PhD thesis, Universit\u00e4t Duisburg\u2013Essen (September 2009), \n                  \n                    http:\/\/www.ti.inf.uni-due.de\/people\/heindel\/diss.pdf"},{"key":"15_CR14","series-title":"Studies in Logic and the Foundation of Mathematics","volume-title":"Categorical Logic and Type Theory","author":"B. Jacobs","year":"1999","unstructured":"Jacobs, B.: Categorical Logic and Type Theory. Studies in Logic and the Foundation of Mathematics, vol.\u00a0141. Elsevier, Amsterdam (1999)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive and quasiadhesive categories. RAIRO \u2013 Theoretical Informatics and Applications\u00a039(3) (2005)","DOI":"10.1051\/ita:2005028"},{"key":"15_CR16","volume-title":"Handbook of Logic in Computer Science V","author":"A.M. Pitts","year":"2001","unstructured":"Pitts, A.M.: Categorical logic. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science V. Oxford University Press, Oxford (2001)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a03256, pp. 319\u2013335. Springer, Heidelberg (2004)"}],"container-title":["IFIP Advances in Information and Communication Technology","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15240-5_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:49:26Z","timestamp":1619786966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15240-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152399","9783642152405"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15240-5_15","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1861-2288"}],"subject":[],"published":{"date-parts":[[2010]]}}}