{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T20:03:21Z","timestamp":1791317001582,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642402050","type":"print"},{"value":"9783642402067","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40206-7_19","type":"book-chapter","created":{"date-parts":[[2013,8,26]],"date-time":"2013-08-26T23:29:41Z","timestamp":1377559781000},"page":"253-266","source":"Crossref","is-referenced-by-count":13,"title":["Simulations and Bisimulations for Coalgebraic Modal Logics"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Gor\u00edn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","volume":"114","author":"M. Barr","year":"1993","unstructured":"Barr, M.: Terminal coalgebras in well-founded set theory. Theoret. Comput. Sci.\u00a0114, 299\u2013315 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR2","series-title":"LNCS","first-page":"126","volume-title":"CALCO 2013","author":"S. Enqvist","year":"2013","unstructured":"Enqvist, S.: Homomorphisms of coalgebras from predicate liftings. In: Heckel, R., Milius, S. (eds.) CALCO 2013. LNCS, vol.\u00a08089, pp. 126\u2013140. Springer, Heidelberg (2013)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Hansen, H., Kupke, C.: A coalgebraic perspective on monotone modal logic. In: Coalgebraic Methods in Computer Science (CMCS 2004). ENTCS, vol.\u00a0106, pp. 121\u2013143. Elsevier (2004)","DOI":"10.1016\/j.entcs.2004.02.028"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-10003-2_79","volume-title":"Automata, Languages and Programming","author":"M. Hennessy","year":"1980","unstructured":"Hennessy, M., Milner, R.: On observing nondeterminism and concurrency. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 299\u2013309. Springer, Heidelberg (1980)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.tcs.2012.03.027","volume":"430","author":"A. Kurz","year":"2012","unstructured":"Kurz, A., Leal, R.A.: Modalities in the Stone age: A comparison of coalgebraic logics. Theor. Comput. Sci.\u00a0430, 88\u2013116 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. Larsen","year":"1991","unstructured":"Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput.\u00a094, 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-19805-2_3","volume-title":"Foundations of Software Science and Computational Structures","author":"P.B. Levy","year":"2011","unstructured":"Levy, P.B.: Similarity quotients as final coalgebras. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 27\u201341. Springer, Heidelberg (2011)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-32784-1_9","volume-title":"Coalgebraic Methods in Computer Science","author":"J. Marti","year":"2012","unstructured":"Marti, J., Venema, Y.: Lax extensions of coalgebra functors. In: Pattinson, D., Schr\u00f6der, L. (eds.) CMCS 2012. LNCS, vol.\u00a07399, pp. 150\u2013169. Springer, Heidelberg (2012)"},{"key":"19_CR9","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. Theoret. Comput. Sci.\u00a0309, 177\u2013193 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR10","first-page":"2004","volume":"45","author":"D. Pattinson","year":"2002","unstructured":"Pattinson, D.: Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Logic\u00a045, 2004 (2002)","journal-title":"Notre Dame J. Formal Logic"},{"key":"19_CR11","unstructured":"Pauly, M.: Bisimulation for general non-normal modal logic (1999) (unpublished Manuscript)"},{"key":"19_CR12","unstructured":"Pauly, M.: Logic for social software. Ph.D. thesis, Universiteit van Amsterdam (2001)"},{"key":"19_CR13","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-1 modal logics. ACM Trans. Comput. Log.\u00a010, 13:1\u201313:33 (2009)","journal-title":"ACM Trans. Comput. Log."},{"issue":"2-3","key":"19_CR14","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. Theoret. Comput. Sci.\u00a0390(2-3), 230\u2013247 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-12032-9_23","volume-title":"Foundations of Software Science and Computational Structures","author":"L. Schr\u00f6der","year":"2010","unstructured":"Schr\u00f6der, L., Pattinson, D.: Coalgebraic correspondence theory. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 328\u2013342. Springer, Heidelberg (2010)"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"5095","DOI":"10.1016\/j.tcs.2011.05.008","volume":"412","author":"A. Sokolova","year":"2011","unstructured":"Sokolova, A.: Probabilistic systems coalgebraically: A survey. Theoret. Comput. Sci.\u00a0412, 5095\u20135110 (2011)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40206-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T19:20:33Z","timestamp":1558034433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40206-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402050","9783642402067"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40206-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}