{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:04:21Z","timestamp":1742997861706,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031664373"},{"type":"electronic","value":"9783031664380"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-66438-0_7","type":"book-chapter","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T07:03:08Z","timestamp":1721890988000},"page":"135-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Explicit Hopcroft\u2019s Trick in\u00a0Categorical Partition Refinement"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3409-6963","authenticated-orcid":false,"given":"Takahiro","family":"Sanada","sequence":"first","affiliation":[]},{"given":"Ryota","family":"Kojima","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3371-5243","authenticated-orcid":false,"given":"Yuichi","family":"Komorida","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-6900","authenticated-orcid":false,"given":"Koko","family":"Muroya","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8300-4650","authenticated-orcid":false,"given":"Ichiro","family":"Hasuo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,26]]},"reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s00224-016-9686-0","volume":"60","author":"C Berkholz","year":"2017","unstructured":"Berkholz, C., Bonsma, P.S., Grohe, M.: Tight lower and upper bounds for the complexity of canonical colour refinement. Theory Comput. Syst. 60(4), 581\u2013614 (2017). https:\/\/doi.org\/10.1007\/s00224-016-9686-0","journal-title":"Theory Comput. Syst."},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Bonchi, F., Holland, J., Piedeleu, R., Sobocinski, P., Zanasi, F.: Diagrammatic algebra: from linear to concurrent systems. Proc. ACM Program. Lang. 3(POPL), 25:1\u201325:28 (2019). https:\/\/doi.org\/10.1145\/3290338","DOI":"10.1145\/3290338"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0304-3975(99)00035-3","volume":"221","author":"E de Vink","year":"1999","unstructured":"de Vink, E., Rutten, J.: Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoret. Comput. Sci. 221(1), 271\u2013293 (1999). https:\/\/doi.org\/10.1016\/S0304-3975(99)00035-3","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-030-30942-8_18","volume-title":"Formal Methods \u2013 The Next 30 Years","author":"H-P Deifel","year":"2019","unstructured":"Deifel, H.-P., Milius, S., Schr\u00f6der, L., Wi\u00dfmann, T.: Generic partition refinement and weighted tree automata. In: ter Beek, M.H., McIver, A., Oliveira, J.N. (eds.) FM 2019. LNCS, vol. 11800, pp. 280\u2013297. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30942-8_18"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Dorsch, U., Milius, S., Schr\u00f6der, L., Wi\u00dfmann, T.: Efficient coalgebraic partition refinement. In: Meyer, R., Nestmann, U. (eds.) 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a085, pp. 32:1\u201332:16. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2017.32","DOI":"10.4230\/LIPIcs.CONCUR.2017.32"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF00264025","volume":"2","author":"D Gries","year":"1973","unstructured":"Gries, D.: Describing an algorithm by Hopcroft. Acta Informatica 2(2), 97\u2013109 (1973)","journal-title":"Acta Informatica"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Groote, J.F., Rivera\u00a0Verduzco, J., De\u00a0Vink, E.P.: An efficient algorithm to determine probabilistic bisimulation. Algorithms 11(9) (2018). https:\/\/doi.org\/10.3390\/a11090131","DOI":"10.3390\/a11090131"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/inco.1998.2725","volume":"145","author":"C Hermida","year":"1998","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","journal-title":"Inf. Comput."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-76336-9_12","volume-title":"Implementation and Application of Automata","author":"J H\u00f6gberg","year":"2007","unstructured":"H\u00f6gberg, J., Maletti, A., May, J.: Backward and forward bisimulation minimisation of tree automata. In: Holub, J., \u017dd\u00e1rek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 109\u2013121. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76336-9_12"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-73208-2_23","volume-title":"Developments in Language Theory","author":"J H\u00f6gberg","year":"2007","unstructured":"H\u00f6gberg, J., Maletti, A., May, J.: Bisimulation minimisation for weighted tree automata. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 229\u2013241. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73208-2_23"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An $$n \\log n$$ algorithm for minimizing states in a finite automaton. In: Theory of Machines and Computations, pp. 189\u2013196. Academic Press (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"7_CR12","unstructured":"Jacobs, B.: Categorical Logic and Type Theory. Studies in logic and the foundations of mathematics, Elsevier Science (1999)"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Jacobs, B.: Introduction to Coalgebra: Towards Mathematics of States and Observation. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press (2016). https:\/\/doi.org\/10.1017\/CBO9781316823187","DOI":"10.1017\/CBO9781316823187"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Jacobs, J., Wi\u00dfmann, T.: Fast coalgebraic bisimilarity minimization. Proc. ACM Program. Lang. 7(POPL) (Jan 2023). https:\/\/doi.org\/10.1145\/3571245","DOI":"10.1145\/3571245"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"PC Kanellakis","year":"1990","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Inf. Comput. 86(1), 43\u201368 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90025-D","journal-title":"Inf. Comput."},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0304-3975(99)00150-4","volume":"250","author":"T Knuutila","year":"2001","unstructured":"Knuutila, T.: Re-describing an algorithm by Hopcroft. Theoret. Comput. Sci. 250(1), 333\u2013363 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(99)00150-4","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s00354-022-00186-y","volume":"40","author":"Y Komorida","year":"2022","unstructured":"Komorida, Y., Katsumata, S., Hu, N., Klin, B., Humeau, S., Eberhart, C., Hasuo, I.: Codensity games for bisimilarity. New Gener. Comput. 40(2), 403\u2013465 (2022). https:\/\/doi.org\/10.1007\/s00354-022-00186-y","journal-title":"New Gener. Comput."},{"issue":"1\u20134","key":"7_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.3233\/FI-222126","volume":"186","author":"S Lombardy","year":"2022","unstructured":"Lombardy, S., Sakarovitch, J.: Morphisms and minimisation of weighted automata. Fundam. Informaticae 186(1\u20134), 195\u2013218 (2022). https:\/\/doi.org\/10.3233\/FI-222126","journal-title":"Fundam. Informaticae"},{"key":"7_CR19","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall Inc., USA (1989)"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Moore, E.F.: Gedanken-Experiments on Sequential Machines, pp. 129\u2013154. Princeton University Press, Princeton (1956). https:\/\/doi.org\/10.1515\/9781400882618-006","DOI":"10.1515\/9781400882618-006"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167\u2013183. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/BFb0017309"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Piedeleu, R., Kartsaklis, D., Coecke, B., Sadrzadeh, M.: Open system categorical quantum semantics in natural language processing. In: Moss, L.S., Sobocinski, P. (eds.) 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015, 24\u201326 June, 2015, Nijmegen, The Netherlands. LIPIcs, vol.\u00a035, pp. 270\u2013289. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2015.270","DOI":"10.4230\/LIPIcs.CALCO.2015.270"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249(1), 3\u201380 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(00)00056-6, modern Algebra","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-02424-5_9","volume-title":"Applications and Theory of Petri Nets","author":"A Valmari","year":"2009","unstructured":"Valmari, A.: Bisimilarity minimization in O(m logn) time. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, pp. 123\u2013142. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02424-5_9"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-12002-2_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Valmari","year":"2010","unstructured":"Valmari, A., Franceschinis, G.: Simple O(m logn) time Markov chain lumping. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 38\u201352. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_4"},{"issue":"4\u20135","key":"7_CR26","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s00165-020-00526-z","volume":"33","author":"T Wi\u00dfmann","year":"2021","unstructured":"Wi\u00dfmann, T., Deifel, H., Milius, S., Schr\u00f6der, L.: From generic partition refinement to weighted tree automata minimization. Formal Aspects Comput. 33(4\u20135), 695\u2013727 (2021). https:\/\/doi.org\/10.1007\/s00165-020-00526-z","journal-title":"Formal Aspects Comput."}],"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-66438-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T07:09:11Z","timestamp":1721891351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66438-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031664373","9783031664380"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66438-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 July 2024","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":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmcs2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coalg.org\/cmcs24\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}