{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:31Z","timestamp":1760202691832,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466773"},{"type":"electronic","value":"9783662466780"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-46678-0_10","type":"book-chapter","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T09:42:21Z","timestamp":1427881341000},"page":"151-166","source":"Crossref","is-referenced-by-count":6,"title":["Coalgebraic Trace Semantics via Forgetful Logics"],"prefix":"10.1007","author":[{"given":"Bartek","family":"Klin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-28729-9_4","volume-title":"Foundations of Software Science and Computational Structures","author":"J. Ad\u00e1mek","year":"2012","unstructured":"Ad\u00e1mek, J., Bonchi, F., H\u00fclsbusch, M., K\u00f6nig, B., Milius, S., Silva, A.: A coalgebraic perspective on minimization and determinization. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol.\u00a07213, pp. 58\u201373. Springer, Heidelberg (2012)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-32621-9_14","volume-title":"Logic, Language, Information and Computation","author":"N. Bezhanishvili","year":"2012","unstructured":"Bezhanishvili, N., Kupke, C., Panangaden, P.: Minimization via duality. In: Ong, L., de Queiroz, R. (eds.) WoLLIC 2012. LNCS, vol.\u00a07456, pp. 191\u2013205. Springer, Heidelberg (2012)"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2490818","volume":"15","author":"F. Bonchi","year":"2014","unstructured":"Bonchi, F., Bonsangue, M.M., Hansen, H.H., Panangaden, P., Rutten, J.J.M.M., Silva, A.: Algebra-coalgebra duality in Brzozowski\u2019s minimization algorithm. ACM Trans. Comput. Log.\u00a015(1), 3 (2014)","journal-title":"ACM Trans. Comput. Log."},{"key":"10_CR4","first-page":"529","volume":"12","author":"J. Brzozowski","year":"1962","unstructured":"Brzozowski, J.: Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata\u00a012, 529\u2013561 (1962)","journal-title":"Mathematical Theory of Automata"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"C\u00eerstea, C.: From branching to linear time, coalgebraically. In: Procs. FICS 2013. EPTCS, vol.\u00a0126, pp. 11\u201327 (2013)","DOI":"10.4204\/EPTCS.126.2"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-54830-7_28","volume-title":"Foundations of Software Science and Computation Structures","author":"C. C\u00eerstea","year":"2014","unstructured":"C\u00eerstea, C.: A coalgebraic approach to linear-time logics. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol.\u00a08412, pp. 426\u2013440. Springer, Heidelberg (2014)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-28644-8_17","volume-title":"CONCUR 2004 - Concurrency Theory","author":"C. C\u00eerstea","year":"2004","unstructured":"C\u00eerstea, C., Pattinson, D.: Modular construction of modal logics. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 258\u2013275. Springer, Heidelberg (2004)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-40206-7_13","volume-title":"Algebra and Coalgebra in Computer Science","author":"S. Goncharov","year":"2013","unstructured":"Goncharov, S.: Trace semantics via generic observations. In: Heckel, R., Milius, S. (eds.) CALCO 2013. LNCS, vol.\u00a08089, pp. 158\u2013174. Springer, Heidelberg (2013)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Log. Meth. Comp. Sci.\u00a03(4) (2007)","DOI":"10.2168\/LMCS-3(4:11)2007"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/inco.1998.2725","volume":"145","author":"C. Hermida","year":"1997","unstructured":"Hermida, C., Jacobs, B.: Structural induction and coinduction in a fibrational setting. Inf. and Comp.\u00a0145, 107\u2013152 (1997)","journal-title":"Inf. and Comp."},{"key":"10_CR11","unstructured":"Jacobs, B.: Introduction to coalgebra. Towards mathematics of states and observations, Draft (2014)"},{"key":"10_CR12","unstructured":"Jacobs, B., Silva, A., Sokolova, A.: Trace semantics via determinization. J. Comp. and Sys. Sci. (2014) (to appear)"},{"issue":"5","key":"10_CR13","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1093\/logcom\/exn093","volume":"20","author":"B. Jacobs","year":"2010","unstructured":"Jacobs, B., Sokolova, A.: Exemplaric expressivity of modal logics. J. Log. and Comput.\u00a020(5), 1041\u20131068 (2010)","journal-title":"J. Log. and Comput."},{"key":"10_CR14","unstructured":"Kissig, C., Kurz, A.: Generic trace logics. CoRR, abs\/1103.3239 (2011)"},{"key":"10_CR15","first-page":"177","volume":"173","author":"B. Klin","year":"2007","unstructured":"Klin, B.: Coalgebraic modal logic beyond sets. ENTCS\u00a0173, 177\u2013201 (2007)","journal-title":"ENTCS"},{"issue":"38","key":"10_CR16","doi-asserted-by":"publisher","first-page":"5070","DOI":"10.1016\/j.tcs.2011.04.023","volume":"412","author":"C. Kupke","year":"2011","unstructured":"Kupke, C., Pattinson, D.: Coalgebraic semantics of modal logics: An overview. Theor. Comput. Sci.\u00a0412(38), 5070\u20135094 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Kurz, A., Milius, S., Pattinson, D., Schr\u00f6der, L.: Simplified coalgebraic trace equivalence. CoRR, abs\/1410.2463 (2014)","DOI":"10.1007\/978-3-319-15545-6_8"},{"issue":"1-2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2004.07.024","volume":"327","author":"M. Lenisa","year":"2004","unstructured":"Lenisa, M., Power, J., Watanabe, H.: Category theory for operational semantics. Theor. Comput. Sci.\u00a0327(1-2), 135\u2013154 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR19","unstructured":"Lane, S.M.: Categories for the working mathematician, vol.\u00a05. Springer (1998)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/11784180_24","volume-title":"Algebraic Methodology and Software Technology","author":"D. Pavlovic","year":"2006","unstructured":"Pavlovic, D., Mislove, M.W., Worrell, J.B.: Testing semantics: Connecting processes and process logics. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol.\u00a04019, pp. 308\u2013322. Springer, Heidelberg (2006)"},{"key":"10_CR21","first-page":"259","volume":"29","author":"J. Power","year":"1999","unstructured":"Power, J., Turi, D.: A coalgebraic foundation for linear time semantics. ENTCS\u00a029, 259\u2013274 (1999)","journal-title":"ENTCS"},{"issue":"1","key":"10_CR22","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. Theor. Comput. Sci.\u00a0249(1), 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR23","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1017\/S0960129510000563","volume":"21","author":"L. Schr\u00f6der","year":"2011","unstructured":"Schr\u00f6der, L., Pattinson, D.: Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra. Math. Struct. in Comp. Sci.\u00a021(2), 235\u2013266 (2011)","journal-title":"Math. Struct. in Comp. Sci."},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Generalizing determinization from automata to coalgebras. Log. Meth. Comp. Sci.\u00a09(1) (2013)","DOI":"10.2168\/LMCS-9(1:9)2013"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46678-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:22:20Z","timestamp":1559139740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46678-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466773","9783662466780"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46678-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}