{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T11:29:21Z","timestamp":1753356561109},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141614"},{"type":"electronic","value":"9783642141621"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14162-1_32","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:21Z","timestamp":1278321981000},"page":"381-392","source":"Crossref","is-referenced-by-count":7,"title":["Automata for Coalgebras: An Approach Using Predicate Liftings"],"prefix":"10.1007","author":[{"given":"Ga\u00eblle","family":"Fontaine","sequence":"first","affiliation":[]},{"given":"Raul","family":"Leal","sequence":"additional","affiliation":[]},{"given":"Yde","family":"Venema","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","volume-title":"Non-Well-Founded Sets","author":"P. Aczel","year":"1988","unstructured":"Aczel, P.: Non-Well-Founded Sets. CSLI Publications, Stanford (1988)"},{"key":"32_CR2","volume-title":"Automata and Algebras in Categories","author":"J. Ad\u00e1mek","year":"1990","unstructured":"Ad\u00e1mek, J., Trnkov\u00e1, V.: Automata and Algebras in Categories. Kluwer Academic Publishers, Dordrecht (1990)"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.07.019","volume":"327","author":"F. Bartels","year":"2004","unstructured":"Bartels, F., Sokolova, A., de Vink, E.: A hierarchy of probabilistic system types. Theoretical Computer Science\u00a0327, 3\u201322 (2004)","journal-title":"Theoretical Computer Science"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.2307\/1994916","volume":"138","author":"J.R. B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J.R., Landweber, L.H.: Solving sequential conditions by finite state strategies. Transactions of the American Mathematical Society\u00a0138, 295\u2013311 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-04027-6_15","volume-title":"Computer Science Logic","author":"C. C\u00eerstea","year":"2009","unstructured":"C\u00eerstea, C., Kupke, C., Pattinson, D.: EXPTIME tableaux for the coalgebraic \u03bc-calculus. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol.\u00a05771, pp. 179\u2013193. Springer, Heidelberg (2009)"},{"key":"32_CR6","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":"#cr-split#-32_CR7.1","doi-asserted-by":"crossref","unstructured":"Hansen, H., Kupke, C.: A coalgebraic perspective on monotone modal logic. Electronic Notes in Theoretical Computer Science??106, 121???143 (2004);","DOI":"10.1016\/j.entcs.2004.02.028"},{"key":"#cr-split#-32_CR7.2","unstructured":"Proceedings of the Workshop on Coalgebraic Methods in Computer Science (CMCS)"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M. Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"issue":"3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. Theoretical Computer Science\u00a027(3), 333\u2013354 (1983)","journal-title":"Theoretical Computer Science"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-4(4:10)2008","volume":"4","author":"C. Kupke","year":"2008","unstructured":"Kupke, C., Venema, Y.: Coalgebraic automata theory: basic results. Logical Methods in Computer Science\u00a04, 1\u201343 (2008)","journal-title":"Logical Methods in Computer Science"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0168-0072(98)00042-6","volume":"96","author":"L. Moss","year":"1999","unstructured":"Moss, L.: Coalgebraic logic. Annals of Pure and Applied Logic\u00a096, 277\u2013317 (1999); Erratum published APAL 99, 241\u2013259, 1999","journal-title":"Annals of Pure and Applied Logic"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(03)00201-9","volume":"309","author":"D. Pattinson","year":"2003","unstructured":"Pattinson, D.: Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoretical Computer Science\u00a0309, 177\u2013193 (2003)","journal-title":"Theoretical Computer Science"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1109\/LICS.2006.28","volume-title":"Proceedings of the Twentyfirst Annual IEEE Symposium on Logic in Computer Science (LICS 2006)","author":"N. Piterman","year":"2006","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. In: Proceedings of the Twentyfirst Annual IEEE Symposium on Logic in Computer Science (LICS 2006), pp. 255\u2013264. IEEE Computer Society, Los Alamitos (2006)"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: A theory of systems. Theoretical Computer Science\u00a0249, 3\u201380 (2000)","journal-title":"Theoretical Computer Science"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462179.1462185","volume":"10","author":"L. Schr\u00f6der","year":"2009","unstructured":"Schr\u00f6der, L., Pattinson, D.: PSPACE bounds for rank\u20131 modal logics. ACM Transactions on Computational Logic\u00a010, 1\u201332 (2009)","journal-title":"ACM Transactions on Computational Logic"},{"key":"32_CR16","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"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s001530100110","volume":"41","author":"A. Visser","year":"2002","unstructured":"Visser, A., D\u2019Agostino, G.: Finality regained: A coalgebraic study of Scott-sets and multisets. Archive for Mathematical Logic\u00a041, 267\u2013298 (2002)","journal-title":"Archive for Mathematical Logic"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14162-1_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:09Z","timestamp":1606186089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}