{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:54Z","timestamp":1761611214182},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540416951"},{"type":"electronic","value":"9783540446934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44693-1_45","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T05:10:18Z","timestamp":1181625018000},"page":"514-526","source":"Crossref","is-referenced-by-count":23,"title":["Semantical Principles in the Modal Logic of Coalgebras"],"prefix":"10.1007","author":[{"given":"Dirk","family":"Pattinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,16]]},"reference":[{"key":"45_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P. Aczel","year":"1989","unstructured":"P. Aczel and N. Mendler. A Final Coalgebra Theorem. In D. H. Pitt et al, editor, Category Theory and Computer Science, volume 389 of LNCS, pages 357\u2013365. Springer, 1989."},{"key":"45_CR2","first-page":"589","volume":"15","author":"J. Ad\u00e1mek","year":"1974","unstructured":"J. Ad\u00e1mek. Free algebras and automata realizations in the language of categories. Comment. Math. Univ. Carolinae, 15:589\u2013602, 1974.","journal-title":"Comment. Math. Univ. Carolinae"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0304-3975(95)00011-K","volume":"150","author":"J. Ad\u00e1mek","year":"1995","unstructured":"J. Ad\u00e1mek and V. Koubek. On the greatest fixed point of a set functor. Theor. Comp. Sci., 150:57\u201375, 1995.","journal-title":"Theor. Comp. Sci"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Alexandru Baltag. A Logic for Coalgebraic Simulation. In Horst Reichel, editor, Coalgebraic Methods in Computer Science (CMCS\u20192000), volume 33 of Electr. Notes in Theoret. Comp. Sci., 2000.","DOI":"10.1016\/S1571-0661(05)80343-3"},{"key":"45_CR5","unstructured":"A. Carboni, G. Kelly, and R. Wood. A 2-categorical approach to change of base and geometric morphisms I. Technical Report 90-1, Dept. of Pure Mathematics, Univ. of Sydney, 1990."},{"key":"45_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/3-540-10003-2_79","volume-title":"Automata, Languages and Programming, 7th Colloquium","author":"M. Hennessy","year":"1980","unstructured":"M. Hennessy and R. Milner. On Observing Nondeterminism and Concurrency. In J. W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming, 7th Colloquium, volume 85 of Lecture Notes in Computer Science, pages 299\u2013309. Springer-Verlag, 1980."},{"key":"45_CR7","first-page":"222","volume":"62","author":"B. Jacobs","year":"1997","unstructured":"B. Jacobs and J. Rutten. A Tutorial on (Co)Algebras and (Co)Induction. EATCS Bulletin, 62:222\u2013259, 1997.","journal-title":"EATCS Bulletin"},{"key":"45_CR8","unstructured":"Bart Jacobs. The temporal logic of coalgebras via Galois algebras. Technical Report CSIR9906, Computing Science Institute, University of Nijmegen, 1999."},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Bart Jacobs. Towards a Duality Result in the Modal Logic of Coalgebras. In Horst Reichel, editor, Coalgebraic Methods in Computer Science (CMCS\u20192000), volume 33 of Electr. Notes in Theoret. Comp. Sci., 2000.","DOI":"10.1016\/S1571-0661(05)80348-2"},{"key":"45_CR10","unstructured":"Alexander Kurz. Coalgebras and Applications to Computer Science. PhD thesis, Universit\u00e4t M\u00fcnchen, April 2000."},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Alexander Kurz. Specifying Coalgebras with Modal Logic. Theor. Comp. Sci., 260, 2000.","DOI":"10.1016\/S0304-3975(00)00125-0"},{"key":"45_CR12","unstructured":"Robin Milner. Communication and Concurrency. International series in computer science. Prentice Hall, 1989."},{"key":"45_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0168-0072(98)00042-6","volume":"96","author":"L. Moss","year":"1999","unstructured":"Lawrence Moss. Coalgebraic Logic. Annals of Pure and Applied Logic, 96:277\u2013317, 1999.","journal-title":"Annals of Pure and Applied Logic"},{"key":"45_CR14","doi-asserted-by":"crossref","unstructured":"Dirk Pattinson. Semantical Principles in the Modal Logic of Coalgebras. Technical report, Institut f\u00fcr Informatik, LMU M\u00fcnchen, 2000.","DOI":"10.1007\/3-540-44693-1_45"},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Martin R\u00f6\u00dfiger. Coalgebras and Modal Logic. In Horst Reichel, editor, Coalgebraic Methods in Computer Science (CMCS\u20192000), volume 33 of Electr. Notes in Theoret. Comp. Sci., 2000.","DOI":"10.1016\/S1571-0661(05)80353-6"},{"key":"45_CR16","doi-asserted-by":"crossref","unstructured":"Martin R\u00f6\u00dfiger. From Modal Logic to Terminal Coalgebras. Theor. Comp. Sci., 260, 2000.","DOI":"10.1016\/S0304-3975(00)00128-6"},{"key":"45_CR17","series-title":"Technical Report","volume-title":"Universal Coalgebra: A theory of systems","author":"J. Rutten","year":"1996","unstructured":"Jan Rutten. Universal Coalgebra: A theory of systems. Technical Report CS-R 9652, CWI, Amsterdam, 1996."},{"key":"45_CR18","doi-asserted-by":"crossref","unstructured":"Jan Rutten. Relators and Metric Bisimulations. In B. Jacobs, L. Moss, H. Reichel, and J. Rutten, editors, Coalgebraic Methods in Computer Science (CMCS\u201998), volume 11 of Electr. Notes in Theoret. Comp. Sci., 1999.","DOI":"10.1016\/S1571-0661(04)00063-5"},{"issue":"4","key":"45_CR19","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"M. Smyth","year":"1982","unstructured":"M. Smyth and G. Plotkin. The Category-Theoretic Solution of Recursive Domain Equations. SIAM Journal of Computing, 11(4):761\u2013783, 1982.","journal-title":"SIAM Journal of Computing"},{"key":"45_CR20","doi-asserted-by":"crossref","unstructured":"Colin Stirling. Modal and temporal logics. In S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2. Oxford Science Publications, 1992.","DOI":"10.1093\/oso\/9780198537618.003.0005"},{"issue":"5","key":"45_CR21","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1017\/S0960129598002588","volume":"8","author":"D. Turi","year":"1998","unstructured":"D. Turi and J. Rutten. On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces. Mathematical Structures in Computer Science, 8(5):481\u2013540, 1998.","journal-title":"Mathematical Structures in Computer Science"},{"key":"45_CR22","volume-title":"Functorial Operational Semantics and its Denotational Dual","author":"D. Turi","year":"1996","unstructured":"Daniele Turi. Functorial Operational Semantics and its Denotational Dual. PhD thesis, Free University, Amsterdam, 1996."},{"key":"45_CR23","doi-asserted-by":"crossref","unstructured":"James Worell. Terminal Sequences for Accessible Endofunctors. In B. Jacobs and J. Rutten, editors, Coalgebraic Methods in Computer Science (CMCS\u201999), volume 19 of Electr. Notes in Theoret. Comp. Sci., 1999.","DOI":"10.1016\/S1571-0661(05)80267-1"}],"container-title":["Lecture Notes in Computer Science","STACS 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44693-1_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T01:42:02Z","timestamp":1707961322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44693-1_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416951","9783540446934"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-44693-1_45","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}