{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:04:33Z","timestamp":1743033873214,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030309411"},{"type":"electronic","value":"9783030309428"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30942-8_18","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:03:06Z","timestamp":1569193386000},"page":"280-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Generic Partition Refinement and Weighted Tree Automata"],"prefix":"10.1007","author":[{"given":"Hans-Peter","family":"Deifel","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Milius","sequence":"additional","affiliation":[]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[]},{"given":"Thorsten","family":"Wi\u00dfmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1017\/S0956796800000885","volume":"3","author":"S Adams","year":"1993","unstructured":"Adams, S.: Efficient sets - a balancing act. J. Funct. Program. 3(4), 553\u2013561 (1993)","journal-title":"J. Funct. Program."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1999.1683","volume":"60","author":"C Baier","year":"2000","unstructured":"Baier, C., Engelen, B., Majster-Cederbaum, M.: Deciding bisimilarity and similarity for probabilistic processes. J. Comput. Syst. Sci. 60, 187\u2013231 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Bartels, F., Sokolova, A., de Vink, E.: A hierarchy of probabilistic system types. In: Coagebraic Methods in Computer Science, CMCS 2003, ENTCS, vol. 82, pp. 57\u201375. Elsevier (2003)","DOI":"10.1016\/S1571-0661(04)80632-7"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-540-31980-1_42","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Bergamini","year":"2005","unstructured":"Bergamini, D., Descoubes, N., Joubert, C., Mateescu, R.: BISIMULATOR: a modular tool for on-the-fly equivalence checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 581\u2013585. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-31980-1_42"},{"issue":"4","key":"18_CR5","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)","journal-title":"Theory Comput. Syst."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Blom, S., Orzan, S.: Distributed branching bisimulation reduction of state spaces. In: Parallel and Distributed Model Checking, PDMC 2003, ENTCS, vol. 89, pp. 99\u2013113. Elsevier (2003)","DOI":"10.1016\/S1571-0661(05)80099-4"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s10009-004-0159-4","volume":"7","author":"S Blom","year":"2005","unstructured":"Blom, S., Orzan, S.: A distributed algorihm for strong bisimulation reduction of state spaces. J. Softw. Tools Technol. Transf. 7(1), 74\u201386 (2005)","journal-title":"J. Softw. Tools Technol. Transf."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Log. Methods Comput. Sci. 10(3) (2014)","DOI":"10.2168\/LMCS-10(3:4)2014"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2007.11.018","volume":"393","author":"P Buchholz","year":"2008","unstructured":"Buchholz, P.: Bisimulation relations for weighted automata. Theor. Comput. Sci. 393, 109\u2013123 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-17465-1_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O Bunte","year":"2019","unstructured":"Bunte, O., et al.: The mCRL2 toolset for analysing concurrent systems. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11428, pp. 21\u201339. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-17465-1_2"},{"key":"18_CR11","unstructured":"Deifel, H.-P.: Implementation and evaluation of efficient partition refinement algorithms. Master\u2019s thesis, Friedrich-Alexander Universit\u00e4t Erlangen-N\u00fcrnberg (2019). \nhttps:\/\/hpdeifel.de\/master-thesis-deifel.pdf"},{"key":"18_CR12","unstructured":"Deifel, H.-P., Milius, S., Schr\u00f6der, L., Wi\u00dfmann, T.: Generic partition refinement and weighted tree automata (2019). \nhttps:\/\/arxiv.org\/abs\/1811.08850"},{"issue":"6","key":"18_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0020-0190(03)00343-0","volume":"87","author":"S Derisavi","year":"2003","unstructured":"Derisavi, S., Hermanns, H., Sanders, W.: Optimal state-space lumping in Markov chains. Inf. Process. Lett. 87(6), 309\u2013315 (2003)","journal-title":"Inf. Process. Lett."},{"key":"18_CR14","unstructured":"Dorsch, U., Milius, S., Schr\u00f6der, L., Wi\u00dfmann, T.: Efficient coalgebraic partition refinement. In: Concurrency Theory, CONCUR 2017, LIPIcs, pp. 32:1\u201332:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"1\u20133","key":"18_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(03)00361-X","volume":"311","author":"A Dovier","year":"2004","unstructured":"Dovier, A., Piazza, C., Policriti, A.: An efficient algorithm for computing bisimulation equivalence. Theor. Comput. Sci. 311(1\u20133), 221\u2013256 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-45614-7_23","volume-title":"FME 2002:Formal Methods\u2014Getting IT Right","author":"H Garavel","year":"2002","unstructured":"Garavel, H., Hermanns, H.: On combining functional verification and performance evaluation using CADP. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol. 2391, pp. 410\u2013429. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45614-7_23"},{"key":"18_CR17","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, 97\u2013109 (1973)","journal-title":"Acta Informatica"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Groote, J., Jansen, D., Keiren, J., Wijs, A.: An O(m log n) algorithm for computing stuttering equivalence and branching bisimulation. ACM Trans. Comput. Log. 18(2), 13:1\u201313:34 (2017)","DOI":"10.1145\/3060140"},{"issue":"9","key":"18_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.3390\/a11090131","volume":"11","author":"J Groote","year":"2018","unstructured":"Groote, J., Verduzco, J., de Vink, E.: An efficient algorithm to determine probabilistic bisimulation. Algorithms 11(9), 131 (2018)","journal-title":"Algorithms"},{"key":"18_CR20","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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-73208-2_23"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"3539","DOI":"10.1016\/j.tcs.2009.03.022","volume":"410","author":"J H\u00f6gberg","year":"2009","unstructured":"H\u00f6gberg, J., Maletti, A., May, J.: Backward and forward bisimulation minimization of tree automata. Theor. Comput. Sci. 410, 3539\u20133552 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.: 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":"18_CR23","first-page":"211","volume":"17","author":"D Huynh","year":"1992","unstructured":"Huynh, D., Tian, L.: On some equivalence relations for probabilistic processes. Fund. Inf. 17, 211\u2013234 (1992)","journal-title":"Fund. Inf."},{"issue":"1","key":"18_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P Kanellakis","year":"1990","unstructured":"Kanellakis, P., Smolka, S.: CCS expressions, finite state processes, and three problems of equivalence. Inf. Comput. 86(1), 43\u201368 (1990)","journal-title":"Inf. Comput."},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ic.2013.04.001","volume":"227","author":"B Klin","year":"2013","unstructured":"Klin, B., Sassone, V.: Structural operational semantics for stochastic and weighted transition systems. Inf. Comput. 227, 58\u201383 (2013)","journal-title":"Inf. Comput."},{"key":"18_CR26","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. Theor. Comput. Sci. 250, 333\u2013363 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"18_CR27","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"18_CR28","unstructured":"PRISM: Benchmarks FMS and WLAN. \nhttp:\/\/www.prismmodelchecker.org\/casestudies\/fms.php\n\n, \nwlan.php\n\n. Accessed 16 Nov 2018"},{"key":"18_CR29","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.ic.2008.01.001","volume":"206","author":"F Ranzato","year":"2008","unstructured":"Ranzato, F., Tapparo, F.: Generalizing the Paige-Tarjan algorithm by abstract interpretation. Inf. Comput. 206, 620\u2013651 (2008)","journal-title":"Inf. Comput."},{"key":"18_CR30","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, 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-662-54458-7_8","volume-title":"Foundations of Software Science and Computation Structures","author":"L Schr\u00f6der","year":"2017","unstructured":"Schr\u00f6der, L., Kozen, D., Milius, S., Wi\u00dfmann, T.: Nominal automata with name binding. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 124\u2013142. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-54458-7_8"},{"key":"18_CR32","unstructured":"Segala, R.: Modelling and verification of randomized distributed real-time systems. Ph.D. thesis, MIT (1995)"},{"key":"18_CR33","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02424-5_9"},{"issue":"3","key":"18_CR34","doi-asserted-by":"publisher","first-page":"319","DOI":"10.3233\/FI-2010-369","volume":"105","author":"A Valmari","year":"2010","unstructured":"Valmari, A.: Simple bisimilarity minimization in O(m logn) time. Fund. Inform. 105(3), 319\u2013339 (2010)","journal-title":"Fund. Inform."},{"key":"18_CR35","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-12002-2_4"},{"issue":"2","key":"18_CR36","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10009-017-0468-z","volume":"20","author":"T van Dijk","year":"2018","unstructured":"van Dijk, T., van de Pol, J.: Multi-core symbolic bisimulation minimization. J. Softw. Tools Technol. Transf. 20(2), 157\u2013177 (2018)","journal-title":"J. Softw. Tools Technol. Transf."},{"key":"18_CR37","unstructured":"Wi\u00dfmann, T., Dorsch, U., Milius, S., Schr\u00f6der, L.: Efficient and modular coalgebraic partition refinement (2019). \nhttps:\/\/arxiv.org\/abs\/1806.05654"}],"container-title":["Lecture Notes in Computer Science","Formal Methods \u2013 The Next 30 Years"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30942-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T06:08:05Z","timestamp":1588658885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30942-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030309411","9783030309428"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30942-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2019.inesctec.pt\/","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":"129","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":"44","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":"7","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":"34% - 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":"4","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":"5,5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}