{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:18:15Z","timestamp":1725574695741},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210023"},{"type":"electronic","value":"9783540399100"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39910-0_27","type":"book-chapter","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T02:40:04Z","timestamp":1395110404000},"page":"626-644","source":"Crossref","is-referenced-by-count":0,"title":["Binary Extensions of S1S and the Composition Method"],"prefix":"10.1007","author":[{"given":"Enrico","family":"Marzano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"J.R. B\u00fcchi. On a Decision Method in Restricted Second Order Arithmetic. Proc. of the 1960 Internat. Congr. of Logic, Methodology and Philosophy of Science, E. Nagel et al. (Eds.), Stanford University Press 1962, pp. 1-11."},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"O. Carton, W. Thomas. The Monadic Theory of Morphic Infinite Words and Generalizations. Proc. of the 25th International Symposium on Mathematical Foundations of Computer Science, LNCS 1893, Springer, 2000.","DOI":"10.1007\/3-540-44612-5_23"},{"key":"27_CR3","volume-title":"Model Theory","author":"CC Chang","year":"1973","unstructured":"C.C. Chang, H.J. Keisler. Model Theory. North-Holland, Amsterdam 1973."},{"key":"27_CR4","first-page":"53","volume":"18","author":"K Culik II","year":"1984","unstructured":"K. Culik II, A. Salomaa, and D. Wood. Systolic tree acceptors. R.A.I.R.O In-formatique Th\u00e9orique, 18:53\u201369, 1984.","journal-title":"R.A.I.R.O In-formatique Th\u00e9orique"},{"key":"27_CR5","unstructured":"H. W. Kamp. Tense Logic and the Theory of Linear Order. Ph.D. Thesis, University of California, Los Angeles, 1968."},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems (Specification). Springer-Verlag, 1992.","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems (Safety). Springer-Verlag, 1995.","DOI":"10.1007\/978-1-4612-4222-2"},{"issue":"4","key":"27_CR8","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1093\/logcom\/12.4.641","volume":"12","author":"A Montanari","year":"2002","unstructured":"A. Montanari, A. Peron, and A. Policriti. Extending Kamp\u2019s Theorem to Model Time Granularity. Journal of Logic and Computation, 12(4):641\u2013678, 2002.","journal-title":"Journal of Logic and Computation"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00257-0","volume":"233","author":"A Monti","year":"2000","unstructured":"A. Monti, A. Peron. Systolic Tree \u03c9-Languages: The Operational and the Logical View. Theoretical Computer Science, 233:1\u201318, 2000.","journal-title":"Theoretical Computer Science"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"379","DOI":"10.2307\/1971037","volume":"102","author":"S Shelah","year":"1975","unstructured":"S. Shelah. The Monadic Theory of Order. In Ann. Math., 102:379\u2013419, 1975.","journal-title":"In Ann. Math."},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"AP Sistla","year":"1987","unstructured":"A.P. Sistla, M.Y. Vardi, and P. Wolper. The complementation problem for B\u00fcchi automata with application to temporal logic. Theoretical Computer Science, 49:217\u2013237, 1987.","journal-title":"Theoretical Computer Science"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on Infinite Objects. Handbook of Theoretical Computer Science, vol. B, J. van Leeuwen (Ed.), Elsevier Sci. Pub., 133-191, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"W. Thomas. Languages, Automata, and Logic. Handbook of Formal Languages, vol. III, G. Rozenberg and A. Salomaa (Eds.), Springer, 389-455, 1997.","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"W. Thomas. Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words. Structures in Logic and Computer Science, A Selection of Essays in Honor of A. Ehrenfeucht, J. Mycielski et al. (Eds.), volume 1261 of Lecture Notes in Computer Science, Springer, 118-143, 1997.","DOI":"10.1007\/3-540-63246-8_8"}],"container-title":["Lecture Notes in Computer Science","Verification: Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39910-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T21:18:45Z","timestamp":1548883125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39910-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540210023","9783540399100"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39910-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}