{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:02Z","timestamp":1725664682700},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602460"},{"type":"electronic","value":"9783540447689"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60246-1_159","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:56:56Z","timestamp":1330279016000},"page":"540-551","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Incremental model checking for decomposable structures"],"prefix":"10.1007","author":[{"given":"J. A.","family":"Makowsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. V.","family":"Ravve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"51_CR1","unstructured":"B. Courcelle. The monadic second-order logic of graphs IX: Machines and their behaviours. Preprint, 1993."},{"key":"51_CR2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(94)90268-2","volume":"126","author":"B. Courcelle","year":"1994","unstructured":"B. Courcelle. Monadic second order graph transductions: A survey. Theoretical Computer Science, 126:53\u201375, 1994.","journal-title":"Theoretical Computer Science"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"B. Courcelle and I. Walukiewicz. Monadic second order logic, graphs and unfoldings of transition systems. Paper in preparation, 1995.","DOI":"10.7146\/brics.v2i44.19945"},{"key":"51_CR4","volume-title":"PhD thesis","author":"E. Dahlhaus","year":"1982","unstructured":"E. Dahlhaus. Combinatorial and Logical Properties of Reductions to some Complete Problems in NP and NL. PhD thesis, Technische Universit\u00e4t Berlin, Germany, 1982."},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"H.D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic, 3rd edition. Undergraduate Texts in Mathematics. Springer-Verlag, 1994.","DOI":"10.1007\/978-1-4757-2355-7_1"},{"key":"51_CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","volume":"49","author":"A. Ehrenfeucht","year":"1961","unstructured":"A. Ehrenfeucht. An application of games to the completeness problem for formalized theories. Fundamenta Mathematicae, 49:129\u2013141, 1961.","journal-title":"Fundamenta Mathematicae"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Hand-book of Theoretical Computer Science, volume 2, chapter 16. Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"51_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4064\/fm-47-1-57-103","volume":"47","author":"S. Feferman","year":"1959","unstructured":"S. Feferman and R. Vaught. The first order properties of products of algebraic systems. Fundamenta Mathematicae, 47:57\u2013103, 1959.","journal-title":"Fundamenta Mathematicae"},{"issue":"3","key":"51_CR9","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/177492.177725","volume":"16","author":"O. Grumberg","year":"1994","unstructured":"O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843\u2013871, 1994.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"51_CR10","doi-asserted-by":"crossref","first-page":"481","DOI":"10.2307\/2273287","volume":"44","author":"Y. Gurevich","year":"1979","unstructured":"Y. Gurevich. Modest theory of short chains, I. Journal of Symbolic Logic, 44:481\u2013490, 1979.","journal-title":"Journal of Symbolic Logic"},{"issue":"4","key":"51_CR11","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N. Immerman","year":"1987","unstructured":"N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760\u2013778, Aug 1987.","journal-title":"SIAM Journal on Computing"},{"key":"51_CR12","unstructured":"J.A. Makowsky. Compactness, embeddings and definability. In Model-Theoretic Logics, Perspectives in Mathematical Logic, chapter 18. Springer Verlag, 1985."},{"key":"51_CR13","volume-title":"Technical Report TR848","author":"J.A. Makowsky","year":"1995","unstructured":"J.A. Makowsky and E. Ravve. Incremental model checking for decomposable structures. Technical Report TR848, revised version, April 1995, Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel, 1995."},{"key":"51_CR14","volume-title":"Technical Report TR844","author":"J.A. Makowsky","year":"1995","unstructured":"J.A. Makowsky and E. Ravve. Incremental model checking for fixed point properties of decomposable structures. Technical Report TR844, revised version, April 1995, Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel, 1995."},{"key":"51_CR15","unstructured":"M.A. Rabin. A simple method for undecidability proofs and some applications. In Y. Bar Hillel, editor, Logic, Methodology and Philosophy of Science II, Studies in Logic, pages 58\u201368. North Holland, 1965."},{"key":"51_CR16","first-page":"1","volume":"141","author":"M. Rabin","year":"1969","unstructured":"M. Rabin. Decidability of second order theories and automata on infinite trees. Transactions of American Mathematical Society, 141:1\u201335, 1969.","journal-title":"Transactions of American Mathematical Society"},{"key":"51_CR17","doi-asserted-by":"crossref","first-page":"379","DOI":"10.2307\/1971037","volume":"102","author":"S. Shelah","year":"1975","unstructured":"S. Shelah. The monadic theory of order. Annals of Mathematics, 102:379\u2013419, 1975.","journal-title":"Annals of Mathematics"},{"key":"51_CR18","unstructured":"S. Shelah. On the very weak 0\u20131 law for random graphs with orders. Preprint, 1992."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1995"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60246-1_159","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T06:09:51Z","timestamp":1593756591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60246-1_159"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602460","9783540447689"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-60246-1_159","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}