{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:51:45Z","timestamp":1725529905518},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642006647"},{"type":"electronic","value":"9783642006654"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00665-4_21","type":"book-chapter","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T16:37:33Z","timestamp":1238431053000},"page":"257-271","source":"Crossref","is-referenced-by-count":2,"title":["Terminal Sequence Induction via Games"],"prefix":"10.1007","author":[{"given":"Clemens","family":"Kupke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","volume-title":"Abstract and Concrete Categories, The Joy of Cats","author":"J. Ad\u00e1mek","year":"1990","unstructured":"Ad\u00e1mek, J., Herrlich, H., Strecker, G.E.: Abstract and Concrete Categories, The Joy of Cats. John Wiley and Sons, Inc., Chichester (1990)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Baltag, A.: A logic for coalgebraic simulation. In: Reichel, H. (ed.) Proceedings of the Workshop on Coalgebraic Methods in Computer Science (CMCS). Electronic Notes in Theoretical Computer Science, vol.\u00a033 (2000)","DOI":"10.1016\/S1571-0661(05)80343-3"},{"key":"21_CR3","first-page":"368","volume-title":"Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (FoCS 1991)","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (FoCS 1991), pp. 368\u2013377. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00012-005-1888-2","volume":"53","author":"H.P. Gumm","year":"2005","unstructured":"Gumm, H.P., Schr\u00f6der, T.: Types and coalgebraic structure. Algebra universalis\u00a053, 229\u2013252 (2005)","journal-title":"Algebra universalis"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73859-6_19","volume-title":"Algebra and Coalgebra in Computer Science","author":"H.H. Hansen","year":"2007","unstructured":"Hansen, H.H., Kupke, C., Pacuit, E.: Bisimulation for neighbourhood structures. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 279\u2013293. Springer, Heidelberg (2007)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0168-0072(98)00042-6","volume":"96","author":"L.S. Moss","year":"1999","unstructured":"Moss, L.S.: Coalgebraic Logic. Annals of Pure and Applied Logic\u00a096, 277\u2013317 (1999)","journal-title":"Annals of Pure and Applied Logic"},{"key":"21_CR8","unstructured":"Mostowski, A.: Games with forbidden positions. Technical Report\u00a078, Instytut Matematyki, Uniwersytet Gda\u0144ski, Poland (1991)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1571-0661(04)00063-5","volume":"11","author":"J.J.M.M. Rutten","year":"1998","unstructured":"Rutten, J.J.M.M.: Relators and Metric Bisimulation (Extended Abstract). Electronic Notes in Theoretical Computer Science\u00a011, 1\u20137 (1998)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: A theory of systems. Theoretical Computer Science\u00a0249, 3\u201380 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"21_CR11","first-page":"271","volume":"221","author":"J.J.M.M. Rutten","year":"1999","unstructured":"Rutten, J.J.M.M., de Vink, E.P.: Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science\u00a0221(1\u20132), 271\u2013293 (1999)","journal-title":"Theoretical Computer Science"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.tcs.2007.09.023","volume":"390","author":"L. Schr\u00f6der","year":"2008","unstructured":"Schr\u00f6der, L.: Expressivity of Coalgebraic Modal Logic: The Limits and Beyond. Theoretical Computer Science\u00a0390, 230\u2013247 (2008)","journal-title":"Theoretical Computer Science"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S1570-2464(07)80009-7","volume-title":"Handbook of Modal Logic","author":"Y. Venema","year":"2006","unstructured":"Venema, Y.: Algebras and coalgebras. In: Handbook of Modal Logic, vol.\u00a03, pp. 331\u2013426. Elsevier, Amsterdam (2006)"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.ic.2005.06.003","volume":"204","author":"Y. Venema","year":"2006","unstructured":"Venema, Y.: Automata and fixed point logic: a coalgebraic perspective. Information and Computation\u00a0204, 637\u2013678 (2006)","journal-title":"Information and Computation"},{"issue":"1\u20133","key":"21_CR15","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.tcs.2004.12.009","volume":"338","author":"J. Worrell","year":"2005","unstructured":"Worrell, J.: On the final sequence of a finitary set functor. Theoretical Computer Science\u00a0338(1\u20133), 184\u2013199 (2005)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00665-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T08:08:03Z","timestamp":1551946083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00665-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642006647","9783642006654"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00665-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}