{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:18:23Z","timestamp":1760080703898,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031107351"},{"type":"electronic","value":"9783031107368"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-10736-8_7","type":"book-chapter","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T17:09:53Z","timestamp":1658509793000},"page":"133-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Corecursion Up-to via\u00a0Causal Transformations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1220-4399","authenticated-orcid":false,"given":"Damien","family":"Pous","sequence":"first","affiliation":[]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7336-9405","authenticated-orcid":false,"given":"Ruben","family":"Turkenburg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,23]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.: A final coalgebra theorem. In: Pitt, D.H., Rydeheard, D.E., Dybjer, P., Pitts, A.M., Poign\u00e9, A. (eds.) Category Theory and Computer Science. LNCS, vol. 389, pp. 357\u2013365. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0018361"},{"key":"7_CR2","unstructured":"Ad\u00e1mek, J.: Free algebras and automata realizations in the language of categories. Commentationes Mathematicae Universitatis Carolinae 15(4), 589\u2013602 (1974). http:\/\/eudml.org\/doc\/16649"},{"issue":"1","key":"7_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":"Ad\u00e1mek, J., Koubek, V.: On the greatest fixed point of a set functor. Theor. Comput. Sci. 150(1), 57\u201375 (1995). https:\/\/doi.org\/10.1016\/0304-3975(95)00011-K","journal-title":"Theor. Comput. Sci."},{"key":"7_CR4","unstructured":"Baldan, P., Bonchi, F., Kerstan, H., K\u00f6nig, B.: Coalgebraic behavioral metrics. Log. Methods Comput. Sci. 14(3) (2018)"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Barr, M.: Algebraically compact functors. J. Pure Appl. Algebr. 82(3), 211\u2013231 (1992). https:\/\/doi.org\/10.1016\/0022-4049(92)90169-G","DOI":"10.1016\/0022-4049(92)90169-G"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Bartels, F.: Generalised coinduction. In: Proceedings of the CMCS, vol. 44 of Electronic Notes in Theoretical Computer Science, pp. 67\u201387. Elsevier (2001). https:\/\/doi.org\/10.1016\/S1571-0661(04)80903-4","DOI":"10.1016\/S1571-0661(04)80903-4"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Bartels, F.: Generalised coinduction. Math. Struct. Comput. Sci. 13(2), 321\u2013348 (2003). https:\/\/doi.org\/10.1017\/S0960129502003900","DOI":"10.1017\/S0960129502003900"},{"key":"7_CR8","unstructured":"Bartels, F.: On generalised coinduction and probabilistic specification formats. PhD thesis, CWI, Amsterdam, April 2004"},{"key":"7_CR9","unstructured":"Bonchi, F., K\u00f6nig, B., Petri\u015fan, D.: Up-to techniques for behavioural metrics via fibrations. In: Proceedings of the CONCUR, vol.118 of LIPIcs, pp. 17:1\u201317:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Bonchi, F., Petri\u015fan, D., Pous, D., Rot, J.: Coinduction up-to in a fibrational setting. In: Proceedings of the CSL-LICS, pp. 20:1\u201320:9. ACM (2014). https:\/\/doi.org\/10.1145\/2603088.2603149","DOI":"10.1145\/2603088.2603149"},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s00236-016-0271-4","volume":"54","author":"F Bonchi","year":"2017","unstructured":"Bonchi, F., Petri\u015fan, D., Pous, D., Rot, J.: A general account of coinduction up-to. Acta Inform. 54(2), 127\u2013190 (2017). https:\/\/doi.org\/10.1007\/s00236-016-0271-4","journal-title":"Acta Inform."},{"key":"7_CR12","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":"7_CR13","doi-asserted-by":"crossref","unstructured":"Danielsson, N.A.: Up-to techniques using sized types. Proc. ACM Program. Lang. 2(POPL), 43:1\u201343:28 (2018)","DOI":"10.1145\/3158131"},{"key":"7_CR14","unstructured":"Girard, J.Y., Lafont, Y., Taylor, P.: Proofs and types. Cambridge Tracts in Theoretical Computer Science 7. Cambridge University Press (1988)"},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1017\/S0960129517000056","volume":"28","author":"I Hasuo","year":"2018","unstructured":"Hasuo, I., Kataoka, T., Cho, K.: Coinductive predicates and final sequences in a fibration. Math. Struct. Comput. Sci. 28(4), 562\u2013611 (2018)","journal-title":"Math. Struct. Comput. Sci."},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Hermida, C., Jacobs, B.: Structural induction and coinduction in a fibrational setting. Inf. Comput. 145(2), 107\u2013152 (1998). https:\/\/doi.org\/10.1006\/inco.1998.2725","DOI":"10.1006\/inco.1998.2725"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Herrlich, H.: Topological functors. Gen. Topol. Appl. 4(2), 125\u2013142 (1974). https:\/\/doi.org\/10.1016\/0016-660X(74)90016-6","DOI":"10.1016\/0016-660X(74)90016-6"},{"issue":"1\u20132","key":"7_CR18","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":"7_CR19","unstructured":"Jacobs, B.: Categorical Logic and Type Theory. Elsevier, Amsterdam (1999)"},{"issue":"4","key":"7_CR20","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.ic.2005.03.006","volume":"204","author":"B Jacobs","year":"2006","unstructured":"Jacobs, B.: Distributive laws for the coinductive solution of recursive equations. Inf. Comput. 204(4), 561\u2013587 (2006). https:\/\/doi.org\/10.1016\/j.ic.2005.03.006","journal-title":"Inf. Comput."},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Jacobs, B.: Introduction to coalgebra: towards mathematics of states and observation, vol. 59 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press (2016). https:\/\/doi.org\/10.1017\/CBO9781316823187","DOI":"10.1017\/CBO9781316823187"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Klin, B.,\u00a0Nachy\u0142a, B.: Presenting morphisms of distributive laws. In: Proceedings of the CALCO, vol. 35 of LIPIcs, pp. 190\u2013204. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2015.190","DOI":"10.4230\/LIPIcs.CALCO.2015.190"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Kupke, C., Rot, J.: Expressive logics for coinductive predicates. Log. Methods Comput. Sci. 17(4) (2021). https:\/\/doi.org\/10.46298\/lmcs-17(4:19)2021","DOI":"10.46298\/lmcs-17(4:19)2021"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S1571-0661(05)80350-0","volume":"33","author":"M Lenisa","year":"2000","unstructured":"Lenisa, M., Power, J., Watanabe, H.: Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. Electr. Notes Theor. Comput. Sci. 33, 230\u2013260 (2000). https:\/\/doi.org\/10.1016\/S1571-0661(05)80350-0","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Levy, P.B.: A ghost at $$\\omega {_{\\text{1}}}$$. Log. Methods Comput. Sci. 14(3) (2018). https:\/\/doi.org\/10.23638\/LMCS-14(3:4)2018","DOI":"10.23638\/LMCS-14(3:4)2018"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Milius, S., Moss, L.S., Schwencke, D.: Abstract GSOS rules and a modular treatment of recursive definitions. Log. Methods Comput. Sci. 9(3) (2013). https:\/\/doi.org\/10.2168\/LMCS-9(3:28)2013","DOI":"10.2168\/LMCS-9(3:28)2013"},{"key":"7_CR27","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Hoboken (1989)"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Parrow, J., Weber, T.: The largest respectful function. Log. Methods Comput. Sci. 12(2) (2016). https:\/\/doi.org\/10.2168\/LMCS-12(2:11)2016","DOI":"10.2168\/LMCS-12(2:11)2016"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-76637-7_24","volume-title":"Programming Languages and Systems","author":"D Pous","year":"2007","unstructured":"Pous, D.: Complete lattices and up-to techniques. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 351\u2013366. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76637-7_24"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Pous, D.: Coinduction all the way up. In: Proceedings of the LICS, pp. 307\u2013316. ACM (2016). https:\/\/doi.org\/10.1145\/2933575.2934564","DOI":"10.1145\/2933575.2934564"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Pous, D., Rot, J.: Companions, codensity and causality. In: Proceedings of the FOSSACS 2017, pp. 106\u2013123 (2017). https:\/\/doi.org\/10.1007\/978-3-662-54458-7_7","DOI":"10.1007\/978-3-662-54458-7_7"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Pous, D., Rot, J.: Companions, causality and codensity. Log. Methods Comput. Sci. 15(3) (2019). https:\/\/doi.org\/10.23638\/LMCS-15(3:14)2019","DOI":"10.23638\/LMCS-15(3:14)2019"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Pous, D., Sangiorgi, D.: Advanced topics in bisimulation and coinduction, chapter about Enhancements of the coinductive proof method. Cambridge University Press (2011). http:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item6542021","DOI":"10.1017\/CBO9780511792588.007"},{"issue":"1\u20132","key":"7_CR34","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0304-3975(01)00024-X","volume":"280","author":"J Power","year":"2002","unstructured":"Power, J., Watanabe, H.: Combining a monad and a comonad. Theor. Comput. Sci. 280(1\u20132), 137\u2013162 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(01)00024-X","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"7_CR35","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1017\/S0960129515000523","volume":"27","author":"J Rot","year":"2017","unstructured":"Rot, J., Bonchi, F., Bonsangue, M., Pous, D., Rutten, J., Silva, A.: Enhanced coalgebraic bisimulation. Math. Struct. Comput. Sci. 27(7), 1236\u20131264 (2017). https:\/\/doi.org\/10.1017\/S0960129515000523","journal-title":"Math. Struct. Comput. Sci."},{"key":"7_CR36","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0960129598002527","volume":"8","author":"D Sangiorgi","year":"1998","unstructured":"Sangiorgi, D.: On the bisimulation proof method. Math. Struct. Comput. Sci. 8, 447\u2013479 (1998). https:\/\/doi.org\/10.1017\/S0960129598002527","journal-title":"Math. Struct. Comput. Sci."},{"key":"7_CR37","doi-asserted-by":"publisher","unstructured":"Silva, A., Bonchi, F., Bonsangue, M., Rutten, J.: Generalizing the powerset construction, coalgebraically. In: Proceedings of the FSTTCS, vol. 8 of LIPIcs, pp. 272\u2013283. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2010). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2010.272","DOI":"10.4230\/LIPIcs.FSTTCS.2010.272"},{"issue":"6","key":"7_CR38","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1093\/logcom\/exab051","volume":"31","author":"D Sprunger","year":"2021","unstructured":"Sprunger, D., Katsumata, S., Dubut, J., Hasuo, I.: Fibrational bisimulations and quantitative reasoning: extended version. J. Log. Comput. 31(6), 1526\u20131559 (2021). https:\/\/doi.org\/10.1093\/logcom\/exab051","journal-title":"J. Log. Comput."},{"key":"7_CR39","unstructured":"Uustalu, T., Vene, V., Pardo, A.: Recursion schemes from comonads. Nord. J. Comput. 8(3), 366\u2013390 (2001). http:\/\/www.cs.helsinki.fi\/njc\/References\/uustaluvp2001:366.html"},{"issue":"1","key":"7_CR40","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S1571-0661(04)80372-4","volume":"65","author":"H Watanabe","year":"2002","unstructured":"Watanabe, H.: Well-behaved translations between structural operational semantics. Electr. Notes Theor. Comput. Sci. 65(1), 337\u2013357 (2002). https:\/\/doi.org\/10.1016\/S1571-0661(04)80372-4","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"1\u20133","key":"7_CR41","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.tcs.2004.12.009","volume":"338","author":"J Worrell","year":"2005","unstructured":"Worrell, J.: On the final sequence of a finitary set functor. Theor. Comput. Sci. 338(1\u20133), 184\u2013199 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.12.009","journal-title":"Theor. Comput. Sci."}],"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-031-10736-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T17:11:09Z","timestamp":1658509869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10736-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031107351","9783031107368"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10736-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 July 2022","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":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coalg.org\/cmcs22\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}