{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:10:49Z","timestamp":1767337849673,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"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_1","type":"book-chapter","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T17:09:53Z","timestamp":1658509793000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Predicate and\u00a0Relation Liftings for\u00a0Coalgebras with\u00a0Side Effects: An Application in\u00a0Coalgebraic Modal Logic"],"prefix":"10.1007","author":[{"given":"Harsh","family":"Beohar","sequence":"first","affiliation":[]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"K\u00fcpper","sequence":"additional","affiliation":[]},{"given":"Christina","family":"Mika-Michalski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,23]]},"reference":[{"key":"1_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. 7213, pp. 58\u201373. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_4"},{"key":"1_CR2","unstructured":"Ad\u00e1mek, J., Herrlich, H., Strecker, G.E.: Abstract and Concrete Categories: The Joy of Cats. No. 17, Reprints in Theory and Applications of Categories (2006). Originally published by: Wiley, New York (1990)"},{"key":"1_CR3","unstructured":"Beohar, H., K\u00f6nig, B., K\u00fcpper, S., Mika-Michalski, C.: Predicate, relation liftings and modal logics for coalgebras with side effects. CoRR abs\/2110.09911 (2021). https:\/\/arxiv.org\/abs\/2110.09911"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"102320","DOI":"10.1016\/j.scico.2019.102320","volume":"186","author":"H Beohar","year":"2020","unstructured":"Beohar, H., K\u00f6nig, B., K\u00fcpper, S., Silva, A.: Conditional transition systems with upgrades. Sci. Comput. Program. 186, 102320 (2020). https:\/\/doi.org\/10.1016\/j.scico.2019.102320","journal-title":"Sci. Comput. Program."},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Beohar, H., K\u00f6nig, B., K\u00fcpper, S., Silva, A., Wi\u00dfmann, T.: A coalgebraic treatment of conditional transition systems with upgrades. Log. Methods Comput. Sci. 14(1) (2018). https:\/\/doi.org\/10.23638\/LMCS-14(1:19)2018. https:\/\/lmcs.episciences.org\/4330","DOI":"10.23638\/LMCS-14(1:19)2018"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Bonchi, F., K\u00f6nig, B., Petrisan, D.: Up-to techniques for behavioural metrics via fibrations. In: Schewe, S., Zhang, L. (eds.) 29th International Conference on Concurrency Theory (CONCUR 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 118, pp. 17:1\u201317:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.17. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2018\/9555","DOI":"10.4230\/LIPIcs.CONCUR.2018.17"},{"key":"1_CR7","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 Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS 2014. Association for Computing Machinery, New York (2014). https:\/\/doi.org\/10.1145\/2603088.2603149","DOI":"10.1145\/2603088.2603149"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Cordy, M., Classen, A., Perrouin, G., Schobbens, P.Y., Heymans, P., Legay, A.: Simulation-based abstractions for software product-line model checking. In: Proceedings of ICSE 2012. International Conference on Software Engineering, pp. 672\u2013682. IEEE (2012)","DOI":"10.1109\/ICSE.2012.6227150"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Dorsch, U., Milius, S., Schr\u00f6der, L.: Graded monads and graded logics for the linear time - branching time spectrum. In: Fokkink, W., van Glabbeek, R.J. (eds.) 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 140, pp. 36:1\u201336:16. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2019.36. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/10938","DOI":"10.4230\/LIPIcs.CONCUR.2019.36"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Ghani, N., Johann, P., Fumex, C.: Indexed induction and coinduction, fibrationally. Log. Methods Comput. Sci. 9(3) (2013). https:\/\/doi.org\/10.2168\/LMCS-9(3:6)2013. https:\/\/lmcs.episciences.org\/738","DOI":"10.2168\/LMCS-9(3:6)2013"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-40206-7_19","volume-title":"Algebra and Coalgebra in Computer Science","author":"D Gor\u00edn","year":"2013","unstructured":"Gor\u00edn, D., Schr\u00f6der, L.: Simulations and bisimulations for coalgebraic modal logics. In: Heckel, R., Milius, S. (eds.) CALCO 2013. LNCS, vol. 8089, pp. 253\u2013266. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40206-7_19"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Hasuo, I., Jacobs, B.P.F., Sokolova, A.: Generic trace semantics via coinduction. Log. Methods Comput. Sci. 3(4) (2007). https:\/\/doi.org\/10.2168\/LMCS-3(4:11)2007. https:\/\/lmcs.episciences.org\/864","DOI":"10.2168\/LMCS-3(4:11)2007"},{"issue":"4","key":"1_CR13","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). https:\/\/doi.org\/10.1017\/S0960129517000056","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/inco.1998.2725","volume":"145","author":"CA Hermida","year":"1998","unstructured":"Hermida, C.A., Jacobs, B.P.F.: Structural induction and coinduction in a fibrational setting. Inf. Comput. 145(2), 107\u2013152 (1998)","journal-title":"Inf. Comput."},{"key":"1_CR15","volume-title":"Categorical Logic and Type Theory, Studies in Logic and the Foundations of Mathematics","author":"BPF Jacobs","year":"1999","unstructured":"Jacobs, B.P.F.: Categorical Logic and Type Theory, Studies in Logic and the Foundations of Mathematics, vol. 141, 1st edn. Elsevier, Amsterdam (1999)","edition":"1"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.entcs.2004.02.031","volume":"106","author":"BPF Jacobs","year":"2004","unstructured":"Jacobs, B.P.F.: Trace semantics for coalgebras. Electron. Notes Theor. Comput. Sci. 106, 167\u2013184 (2004). Proceedings of the Workshop on Coalgebraic Methods in Computer Science (CMCS)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"1_CR17","unstructured":"Jacobs, B.P.F.: Predicate logic for functors and monads (2010). http:\/\/www.cs.ru.nl\/~bart\/PAPERS\/predlift-indcat.pdf"},{"key":"1_CR18","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316823187","volume-title":"Introduction to Coalgebra: Towards Mathematics of States and Observation","author":"BPF Jacobs","year":"2016","unstructured":"Jacobs, B.P.F.: Introduction to Coalgebra: Towards Mathematics of States and Observation. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge (2016). https:\/\/doi.org\/10.1017\/CBO9781316823187"},{"issue":"5","key":"1_CR19","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1016\/j.jcss.2014.12.005","volume":"81","author":"BPF Jacobs","year":"2015","unstructured":"Jacobs, B.P.F., Silva, A., Sokolova, A.: Trace semantics via determinization. J. Comput. Syst. Sci. 81(5), 859\u2013879 (2015). 11th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2012 (Selected Papers)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"1_CR20","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1093\/logcom\/exn093","volume":"20","author":"BPF Jacobs","year":"2010","unstructured":"Jacobs, B.P.F., Sokolova, A.: Exemplaric expressivity of modal logics. J. Log. Comput. 20(5), 1041\u20131068 (2010)","journal-title":"J. Log. Comput."},{"key":"1_CR21","unstructured":"Kissig, C., Kurz, A.: Generic trace logics (2011). arXiv:1103.3239"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/11548133_16","volume-title":"Algebra and Coalgebra in Computer Science","author":"B Klin","year":"2005","unstructured":"Klin, B.: The least fibred lifting and the expressivity of coalgebraic modal logic. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 247\u2013262. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11548133_16"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Klin, B., Rot, J.: Coalgebraic trace semantics via forgetful logics. Log. Methods Comput. Sci. 12(4) (2017). https:\/\/doi.org\/10.2168\/LMCS-12(4:10)2016. https:\/\/lmcs.episciences.org\/2622","DOI":"10.2168\/LMCS-12(4:10)2016"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Komorida, Y., Katsumata, S., Hu, N., Klin, B., Hasuo, I.: Codensity games for bisimilarity. In: 2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201313 (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785691","DOI":"10.1109\/LICS.2019.8785691"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Komorida, Y., Katsumata, S.Y., Kupke, C., Rot, J., Hasuo, I.: Expressivity of quantitative modal logics: categorical foundations via codensity and approximation. Accepted for publication in LICS 2021, June 2021","DOI":"10.1109\/LICS52264.2021.9470656"},{"key":"1_CR26","unstructured":"K\u00f6nig, B., Mika-Michalski, C.: (Metric) bisimulation games and real-valued modal logics for coalgebras. In: Proceedings of CONCUR 2018. LIPIcs, vol. 118, pp. 37:1\u201337:17. Schloss Dagstuhl - Leibniz Center for Informatics (2018)"},{"issue":"38","key":"1_CR27","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. 412(38), 5070\u20135094 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.04.023. CMCS Tenth Anniversary Meeting","journal-title":"Theor. Comput. Sci."},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Kupke, C., Rot, J.: Expressive logics for coinductive predicates. In: Fern\u00e1ndez, M., Muscholl, A. (eds.) 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 152, pp. 26:1\u201326:18. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2020.26","DOI":"10.4230\/LIPIcs.CSL.2020.26"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/3-540-58027-1_15","volume-title":"Mathematical Foundations of Programming Semantics","author":"PS Mulry","year":"1994","unstructured":"Mulry, P.S.: Lifting theorems for Kleisli categories. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 304\u2013319. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58027-1_15"},{"issue":"1","key":"1_CR30","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. Theor. Comput. Sci. 309(1), 177\u2013193 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR31","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"},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1_CR33","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. Theor. Comput. Sci. 390(2), 230\u2013247 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-030-00389-0_11","volume-title":"Coalgebraic Methods in Computer Science","author":"D Sprunger","year":"2018","unstructured":"Sprunger, D., Katsumata, S., Dubut, J., Hasuo, I.: Fibrational bisimulations and quantitative reasoning. In: C\u00eerstea, C. (ed.) CMCS 2018. LNCS, vol. 11202, pp. 190\u2013213. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00389-0_11"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T17:10:42Z","timestamp":1658509842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10736-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031107351","9783031107368"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10736-8_1","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)"}}]}}