{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T04:18:05Z","timestamp":1751948285357,"version":"3.41.2"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030003883"},{"type":"electronic","value":"9783030003890"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00389-0_8","type":"book-chapter","created":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T19:12:43Z","timestamp":1537384363000},"page":"122-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Steps and Traces"],"prefix":"10.1007","author":[{"given":"Bart","family":"Jacobs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Levy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1017\/S0960129502003900","volume":"13","author":"F Bartels","year":"2003","unstructured":"Bartels, F.: Generalised coinduction. Math. Struct. Comput. Sci. 13(2), 321\u2013348 (2003)","journal-title":"Math. Struct. Comput. Sci."},{"key":"8_CR2","unstructured":"Bonchi, F., Silva, A., Sokolova, A.: The power of convex algebras. In: Meyer, R., Nestmann, U. (eds.) 28th International Conference on Concurrency Theory, CONCUR 2017, LIPIcs. vol. 85, pp. 23:1\u201323:18. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-540-31982-5_29","volume-title":"Foundations of Software Science and Computational Structures","author":"MM Bonsangue","year":"2005","unstructured":"Bonsangue, M.M., Kurz, A.: Duality for logics of transition systems. In: Sassone, V. (ed.) FoSSaCS 2005. LNCS, vol. 3441, pp. 455\u2013469. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31982-5_29"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/2422085.2422092","volume":"14","author":"M Bonsangue","year":"2013","unstructured":"Bonsangue, M., Milius, S., Silva, A.: Sound and complete axiomatizations of coalgebraic language equivalence. ACM Trans. Comput. Log. 14(1), 7:1\u20137:52 (2013)","journal-title":"ACM Trans. Comput. Log."},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.ic.2005.08.005","volume":"204","author":"V Capretta","year":"2006","unstructured":"Capretta, V., Uustalu, T., Vene, V.: Recursive coalgebras from comonads. Inf. Comput. 204(4), 437\u2013468 (2006)","journal-title":"Inf. Comput."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-10452-7_7","volume-title":"Formal Methods: Foundations and Applications","author":"V Capretta","year":"2009","unstructured":"Capretta, V., Uustalu, T., Vene, V.: Corecursive algebras: a study of general structured corecursion. In: Oliveira, M.V.M., Woodcock, J. (eds.) SBMF 2009. LNCS, vol. 5902, pp. 84\u2013100. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10452-7_7"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.entcs.2014.10.007","volume":"308","author":"L-T Chen","year":"2014","unstructured":"Chen, L.-T., Jung, A.: On a categorical framework for coalgebraic modal logic. Electron. Notes Theor. Comput. Sci. 308, 109\u2013128 (2014)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"8_CR8","unstructured":"C\u00eerstea, C.: A coalgebraic approach to quantitative linear time logics. CoRR, abs\/1612.07844 (2016)"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/S1571-0661(05)80305-6","volume":"29","author":"A Eppendahl","year":"1999","unstructured":"Eppendahl, A.: Coalgebra-to-algebra morphisms. Electron. Notes Theor. Comput. Sci. 29, 42\u201349 (1999)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"8_CR10","series-title":"Cambridge Tracts in Theoretical Computer Science 7","volume-title":"Proofs and Types","author":"JY Girard","year":"1988","unstructured":"Girard, J.Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science 7. Cambridge University Press, Cambridge (1988)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2015.03.047","volume":"604","author":"I Hasuo","year":"2015","unstructured":"Hasuo, I.: Generic weakest precondition semantics from monads enriched with order. Theor. Comput. Sci. 604, 2\u201329 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Log. Methods Comput. Sci. 3(4) (2007)","DOI":"10.2168\/LMCS-3(4:11)2007"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Hino, W., Kobayashi, H., Hasuo, I., Jacobs, B.: Healthiness from duality. In: Logic in Computer Science. Computer Science Press, IEEE (2016)","DOI":"10.1145\/2933575.2935319"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Hinze, R., Wu, N., Gibbons, J.: Conjugate hylomorphisms - or: the mother of all structured recursion schemes. In: Rajamani, S.K., Walker, D. (eds.) Proceedings of the Symposium on Principles of Programming Languages, POPL 2015, pp. 527\u2013538. ACM (2015)","DOI":"10.1145\/2775051.2676989"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11780274_20","volume-title":"Algebra, Meaning, and Computation","author":"B Jacobs","year":"2006","unstructured":"Jacobs, B.: A bialgebraic review of deterministic automata, regular expressions and languages. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol. 4060, pp. 375\u2013404. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11780274_20"},{"key":"8_CR16","unstructured":"Jacobs, B.: A recipe for state and effect triangles. Log. Methods Comput. Sci. 13(2), (2017). https:\/\/lmcs.episciences.org\/3660"},{"issue":"5","key":"8_CR17","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1016\/j.jcss.2014.12.005","volume":"81","author":"B Jacobs","year":"2015","unstructured":"Jacobs, B., Silva, A., Sokolova, A.: Trace semantics via determinization. J. Comput. Syst. Sci. 81(5), 859\u2013879 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR18","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BFb0063101","volume-title":"Category Seminar","author":"GM Kelly","year":"1974","unstructured":"Kelly, G.M., Street, R.: Review of the elements of 2-categories. In: Kelly, G.M. (ed.) Category Seminar. LNM, vol. 420, pp. 75\u2013103. Springer, Heidelberg (1974). https:\/\/doi.org\/10.1007\/BFb0063101"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-662-44124-4_10","volume-title":"Coalgebraic Methods in Computer Science","author":"H Kerstan","year":"2014","unstructured":"Kerstan, H., K\u00f6nig, B., Westerbaan, B.: Lifting adjunctions to coalgebras to (re)discover automata constructions. In: Bonsangue, M.M. (ed.) CMCS 2014 2014. LNCS, vol. 8446, pp. 168\u2013188. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44124-4_10"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.entcs.2007.02.034","volume":"173","author":"Bartek Klin","year":"2007","unstructured":"Klin, B.: Coalgebraic modal logic beyond sets. In: Fiore, M. (ed.) Mathematical Foundations of Programming Semantics, ENTCS. vol. 173. Elsevier, Amsterdam (2007)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Klin, B., Rot, J.: Coalgebraic trace semantics via forgetful logics. Log. Methods Comput. Sci. 12(4:10) (2016). https:\/\/lmcs.episciences.org\/2622","DOI":"10.2168\/LMCS-12(4:10)2016"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-15545-6_8","volume-title":"Software, Services, and Systems","author":"A Kurz","year":"2015","unstructured":"Kurz, A., Milius, S., Pattinson, D., Schr\u00f6der, L.: Simplified coalgebraic trace equivalence. In: De Nicola, R., Hennicker, R. (eds.) Software, Services, and Systems. LNCS, vol. 8950, pp. 75\u201390. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15545-6_8"},{"key":"8_CR23","series-title":"London Mathematical Society Lecture Notes","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525896","volume-title":"Higher Operads, Higher Categories","author":"T Leinster","year":"2004","unstructured":"Leinster, T.: Higher Operads, Higher Categories. London Mathematical Society Lecture Notes, vol. 298. Cambridge University Press, Cambridge (2004)"},{"key":"8_CR24","unstructured":"Levy, P.: Final coalgebras from corecursive algebras. In: Moss, L., Sobocinski, P. (eds.) Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), LIPIcs. vol. 35, pp. 221\u2013237. Schloss Dagstuhl (2015)"},{"key":"8_CR25","unstructured":"Milius, S., Pattinson, D., Schr\u00f6der, L.: Generic trace semantics and graded monads. In: 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015, Nijmegen, The Netherlands, 24\u201326 June 2015, pp. 253\u2013269 (2015)"},{"issue":"1","key":"8_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.05.003","volume":"196","author":"S Milius","year":"2005","unstructured":"Milius, S.: Completely iterative algebras and completely iterative monads. Inf. Comput. 196(1), 1\u201341 (2005)","journal-title":"Inf. Comput."},{"key":"8_CR27","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., Worrell, J.B.: Testing semantics: connecting processes and process logics. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 308\u2013322. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11784180_24"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.entcs.2016.09.042","volume":"325","author":"J Rot","year":"2016","unstructured":"Rot, J.: Coalgebraic minimization of automata by initiality and finality. Electron. Notes Theor. Comput. Sci. 325, 253\u2013276 (2016)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Silva, A., Bonchi, F., Bonsangue, M., Rutten, J.: Generalizing determinization from automata to coalgebras. Log. Methods Comput. Sci. 9(1) (2013)","DOI":"10.2168\/LMCS-9(1:9)2013"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Turi, D., Plotkin, G.D.: Towards a mathematical operational semantics. In: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, 29 June\u20132 July 1997, pp. 280\u2013291. IEEE Computer Society (1997)","DOI":"10.1109\/LICS.1997.614955"}],"container-title":["Lecture Notes in Computer Science","Coalgebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00389-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T22:29:22Z","timestamp":1751927362000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00389-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030003883","9783030003890"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00389-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"20 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CMCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Coalgebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmcs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.coalg.org\/cmcs18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}