{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:12:39Z","timestamp":1725732759327},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44124-4_6","type":"book-chapter","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T11:20:39Z","timestamp":1408447239000},"page":"98-117","source":"Crossref","is-referenced-by-count":0,"title":["A Coalgebraic View of Characteristic Formulas in Equational Modal Fixed Point Logics"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Enqvist","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua","family":"Sack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,20]]},"reference":[{"issue":"5","key":"6_CR1","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1093\/logcom\/exn090","volume":"20","author":"J Ad\u00e1mek","year":"2010","unstructured":"Ad\u00e1mek, J., Gumm, H.P., Trnkov\u00e1, V.: Presentation of set functors: a coalgebraic perspective. J. Logic Comput. 20(5), 991\u20131015 (2010)","journal-title":"J. Logic Comput."},{"issue":"02","key":"6_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1017\/S0960129511000375","volume":"22","author":"L Aceto","year":"2012","unstructured":"Aceto, L., Ingolfsdottir, A., Levy, P., Sack, J.: Characteristic formulae for fixed-point semantics: a general framework. Math. Struct. Comput. Sci. 22(02), 125\u2013173 (2012)","journal-title":"Math. Struct. Comput. Sci."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/S1571-0661(05)80343-3","volume":"33","author":"A Baltag","year":"2000","unstructured":"Baltag, A.: A logic for coalgebraic simulation. Electron. Notes Theor. Comput. Sci. 33, 42\u201346 (2000)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"6_CR4","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BFb0060439","volume-title":"Reports of the Midwest Category Seminar IV","author":"M Barr","year":"1970","unstructured":"Barr, M.: Relational algebras. In: MacLane, S., et al. (eds.) Reports of the Midwest Category Seminar IV. Lecture Notes in Mathematics, vol. 137, pp. 39\u201355. Springer, Heidelberg (1970)"},{"key":"6_CR5","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. Theor. Comput. Sci. 114, 299\u2013315 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.tcs.2004.10.021","volume":"333","author":"F Breugel van","year":"2005","unstructured":"van Breugel, F., Mislove, M., Ouaknine, J., Worrell, J.: Domain theory, testing and simulation for labelled Markov processes. Theor. Comput. Sci. 333, 171\u2013197 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"6_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2004.07.022","volume":"327","author":"J Hughes","year":"2004","unstructured":"Hughes, J., Jacobs, B.: Simulations in coalgebra. Theor. Comput. Sci. 327(1\u20132), 71\u2013108 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR8","unstructured":"Kurz, A., Leal, R.: Equational coalgebraic logic. In: Abramsky, S., Mislove, M., Palamidessi, C. (eds.): Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics (MFPS 2009) Electronic Notes in Theoretical Computer Science, vol. 249, pp. 333\u2013356 (2009)"},{"key":"6_CR9","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":"PB Levy","year":"2011","unstructured":"Levy, P.B.: Similarity quotients as final coalgebras. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 27\u201341. Springer, Heidelberg (2011)"},{"key":"6_CR10","unstructured":"Marti, J.: Relation liftings in coalgebraic modal logic. M.Sc. thesis, Institute for Logic, Language and Computation, University of Amsterdam (2011)"},{"key":"6_CR11","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. 7399, pp. 150\u2013169. Springer, Heidelberg (2012)"},{"key":"6_CR12","unstructured":"Marti, J., Venema, Y.: Lax extensions of coalgebra functors and their logics. J. Comput. Syst. Sci. (2014), to appear"},{"key":"6_CR13","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. Ann. Pure Appl. Logic 96, 277\u2013317 (1999)","journal-title":"Ann. Pure Appl. Logic"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S1571-0661(05)80257-9","volume":"18","author":"M M\u00fcller-Olm","year":"1998","unstructured":"M\u00fcller-Olm, M.: Derivation of characteristic formulae. Electron. Notes Theor. Comput. Sci. 18, 159\u2013170 (1998)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-642-27940-9_26","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"J Sack","year":"2012","unstructured":"Sack, J., Zhang, L.: A general framework for probabilistic characterizing formulae. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 396\u2013411. Springer, Heidelberg (2012)"},{"issue":"2","key":"6_CR16","first-page":"250","volume":"2","author":"R Segala","year":"1995","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nord. J. Comput. 2(2), 250\u2013273 (1995)","journal-title":"Nord. J. Comput."},{"key":"6_CR17","unstructured":"Thijs, A.: Simulation and fixpoint semantics. Ph.D. thesis, University of Groningen (1996)"},{"key":"6_CR18","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. Inf. Comput. 204, 637\u2013678 (2006)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44124-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T12:51:05Z","timestamp":1558961465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44124-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44124-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}