{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:46Z","timestamp":1740107866044,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,9,26]],"date-time":"2016-09-26T00:00:00Z","timestamp":1474848000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["KO 2185\/7"],"award-info":[{"award-number":["KO 2185\/7"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s00500-016-2363-z","type":"journal-article","created":{"date-parts":[[2016,9,25]],"date-time":"2016-09-25T22:11:41Z","timestamp":1474841501000},"page":"1103-1120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata"],"prefix":"10.1007","volume":"22","author":[{"given":"Barbara","family":"K\u00f6nig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1243-6306","authenticated-orcid":false,"given":"Sebastian","family":"K\u00fcpper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,26]]},"reference":[{"key":"2363_CR1","doi-asserted-by":"crossref","unstructured":"Ad\u00e1mek J, Rosick\u00fd J (1994) Locally presentable and accessible categories, volume 189 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511600579"},{"key":"2363_CR2","doi-asserted-by":"crossref","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 (1995) On the greatest fixed point of a set functor. Theor Comput Sci 150:57\u201375","journal-title":"Theor Comput Sci"},{"key":"2363_CR3","volume-title":"Abstract and concrete categories\u2014the joy of cats","author":"J Ad\u00e1mek","year":"1990","unstructured":"Ad\u00e1mek J, Herrlich H, Strecker GE (1990) Abstract and concrete categories\u2014the joy of cats. Wiley, New York"},{"key":"2363_CR4","doi-asserted-by":"crossref","unstructured":"Ad\u00e1mek J, Bonchi F, H\u00fclsbusch M, K\u00f6nig B, Milius S, Silva A (2012) A coalgebraic perspective on minimization and determinization. In: Proceedings of FOSSACS \u201912, LNCS\/ARCoSS 7213. Springer, pp 58\u201373","DOI":"10.1007\/978-3-642-28729-9_4"},{"key":"2363_CR5","doi-asserted-by":"crossref","unstructured":"Almagor S, Boker U, Kupferman O (2011) What\u2019s decidable about weighted automata? In: Proceedings of ATVA \u201911, LNCS 6996. Springer, pp 482\u2013491","DOI":"10.1007\/978-3-642-24372-1_37"},{"key":"2363_CR6","doi-asserted-by":"crossref","unstructured":"Baier C (1996) Polynomial time algorithms for testing probabilistic bisimulation and simulation. In: Proceedings of CAV \u201996, LNCS 1102. Springer, pp 50\u201361","DOI":"10.1007\/3-540-61474-5_57"},{"key":"2363_CR7","doi-asserted-by":"crossref","unstructured":"B\u00e9al M-P, Lombardy S, Sakarovitch J (2005) On the equivalence of $$\\mathbb{Z}$$ Z -automata. In: Proceedings of ICALP \u201905, LNCS 3580. Springer, pp 397\u2013409","DOI":"10.1007\/11523468_33"},{"key":"2363_CR8","doi-asserted-by":"crossref","unstructured":"B\u00e9al M-P, Lombardy S, Sakarovitch J (2006) Conjugacy and equivalence of weighted automata and functional transducers. In: Proceedings of CSR \u201906, LNCS 3967. Springer, pp 58\u201369","DOI":"10.1007\/11753728_9"},{"key":"2363_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational series and their languages","author":"J Berstel","year":"1988","unstructured":"Berstel J, Reutenauer C (1988) Rational series and their languages. Springer, Berlin"},{"key":"2363_CR10","doi-asserted-by":"crossref","unstructured":"Bloom SL, \u00c9sik Z (1993) Iteration theories: the equational logic of iterative processes. In: EATCS monographs on theoretical computer science. Springer","DOI":"10.1007\/978-3-642-78034-9_6"},{"issue":"7","key":"2363_CR11","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/j.ic.2009.02.003","volume":"207","author":"SL Bloom","year":"2009","unstructured":"Bloom SL, \u00c9sik Z (2009) Axiomatizing rational power series over natural numbers. Inf Comput 207(7):793\u2013811","journal-title":"Inf Comput"},{"key":"2363_CR12","volume-title":"Residuation theory","author":"TS Blyth","year":"1972","unstructured":"Blyth TS, Janowitz MF (1972) Residuation theory. Pergamon Press, Oxford"},{"key":"2363_CR13","doi-asserted-by":"crossref","unstructured":"Bonchi F, Petrisan D, Pous D, Rot J (2014) Coinduction up to in a fibrational setting. CoRR abs\/1401.6675","DOI":"10.1145\/2603088.2603149"},{"key":"2363_CR14","doi-asserted-by":"publisher","unstructured":"Bonsangue M, Milius S, Silva A (2013) Sound and complete axiomatizations of coalgebraic language equivalence. ACM Trans Comput Log 14(1):7. doi: 10.1145\/2422085.2422092","DOI":"10.1145\/2422085.2422092"},{"key":"2363_CR15","doi-asserted-by":"crossref","unstructured":"Boreale M (2009) Weighted bisimulation in linear algebraic form. In: Proceedings of CONCUR \u201909, LNCS 5710. Springer, pp 163\u2013177","DOI":"10.1007\/978-3-642-04081-8_12"},{"key":"2363_CR16","doi-asserted-by":"crossref","unstructured":"Cuninghame-Green RA (1979) Minimax algebra. Lecture notes in economics and mathematical systems. Springer","DOI":"10.1007\/978-3-642-48708-8"},{"key":"2363_CR17","unstructured":"Droste M, Kuske D (2013) Weighted automata. In: Pin J-E (ed) Automata: from mathematics to applications. European Mathematical Society, Switzerland (to appear)"},{"volume-title":"Handbook of weighted automata","year":"2009","key":"2363_CR18","unstructured":"Droste M, Kuich W, Vogler H (eds) (2009) Handbook of weighted automata. Springer, Berlin"},{"key":"2363_CR19","doi-asserted-by":"crossref","unstructured":"Eisner J (2003) Simpler and more general minimization for weighted finite-state automata. In: Proceedings of HLT-NAACL \u201903. Association for Computational Linguistics, vol 1, pp 64\u201371","DOI":"10.3115\/1073445.1073454"},{"key":"2363_CR20","first-page":"159","volume":"276","author":"Z \u00c9sik","year":"2011","unstructured":"\u00c9sik Z (2011) Multi-linear iterative k- $$\\varSigma $$ \u03a3 -semialgebras. ENTCS 276:159\u2013170","journal-title":"ENTCS"},{"key":"2363_CR21","doi-asserted-by":"crossref","unstructured":"\u00c9sik Z, Kuich W (2001) A generalization of Kozen\u2019s axiomatization of the equational theory of the regular sets. In: Words, semigroups, and transductions\u2014Festschrift in Honor of Gabriel Thierrin, pp 99\u2013114","DOI":"10.1142\/9789812810908_0008"},{"key":"2363_CR22","unstructured":"\u00c9sik Z, Maletti A (2010) Simulation vs. equivalence. In: Proceedings of FCS \u201910. CSREA Press, pp 119\u2013124"},{"issue":"3\u20134","key":"2363_CR23","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.jlap.2013.01.001","volume":"82","author":"Z \u00c9sik","year":"2013","unstructured":"\u00c9sik Z, Kuich W (2013) Free inductive k-semialgebras. J Log Algebr Program 82(3\u20134):111\u2013122","journal-title":"J Log Algebr Program"},{"issue":"2\u20133","key":"2363_CR24","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.tcs.2004.09.021","volume":"331","author":"G Ferrari","year":"2005","unstructured":"Ferrari G, Montanari U, Tuosto E (2005) Coalgebraic minimization of HD-automata for the $$\\pi $$ \u03c0 -calculus using polymorphic types. Theor Comput Sci 331(2\u20133):325\u2013365","journal-title":"Theor Comput Sci"},{"issue":"3","key":"2363_CR25","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0020-0190(97)00162-2","volume":"64","author":"M Flouret","year":"1997","unstructured":"Flouret M, Laugerotte \u00c9 (1997) Noncommutative minimization algorithms. Inf Process Lett 64(3):123\u2013126","journal-title":"Inf Process Lett"},{"issue":"4:11","key":"2363_CR26","first-page":"1","volume":"3","author":"I Hasuo","year":"2007","unstructured":"Hasuo I, Jacobs B, Sokolova A (2007) Generic trace semantics via coinduction. Log Methods Comput Sci 3(4:11):1\u201336","journal-title":"Log Methods Comput Sci"},{"key":"2363_CR27","volume-title":"Introduction to automata theory, languages and computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft JE, Ullman J (1979) Introduction to automata theory, languages and computation. Addison Wesley, Reading"},{"key":"2363_CR28","doi-asserted-by":"crossref","unstructured":"Kiefer S, Murawski AS., Ouaknine J, Wachter B, Worrell J (2011) Language equivalence for probabilistic automata. In: Proceedings of CAV \u201911, LNCS 6806. Springer, pp 526\u2013540","DOI":"10.1007\/978-3-642-22110-1_42"},{"key":"2363_CR29","doi-asserted-by":"crossref","unstructured":"K\u00f6nig B, K\u00fcpper S (2014) Generic partition refinement algorithms for coalgebras and an instantiation to weighted automata. In: Proceedings of TCS \u201914, IFIP AICT, LNCS 8705. Springer, pp. 311\u2013325","DOI":"10.1007\/978-3-662-44602-7_24"},{"key":"2363_CR30","doi-asserted-by":"crossref","unstructured":"Krob D (1991) Expressions rationnelles sur un anneau. In: Topics in invariant theory: S\u00e9minaire d\u2019Alg\u00e8bre P. Dubreil et M.-P. Malliavin 1989\u20131990 (40\u00e8me Ann\u00e9e). Springer, pp 215\u2013243","DOI":"10.1007\/BFb0083505"},{"issue":"3","key":"2363_CR31","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1142\/S0218196794000063","volume":"4","author":"D Krob","year":"1994","unstructured":"Krob D (1994) The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Int J Algebra Comput 4(3):405\u2013425","journal-title":"Int J Algebra Comput"},{"key":"2363_CR32","doi-asserted-by":"crossref","unstructured":"Larsen KG, Skou A (1989) Bisimulation through probabilistic testing (preliminary report). In: Proceedings of POPL \u201989. ACM, pp 344\u2013352","DOI":"10.1145\/75277.75307"},{"key":"2363_CR33","unstructured":"Mika C (2015) Ein generisches Werkzeug f\u00fcr Sprach\u00e4quivalenz bei gewichteten Automaten. Master\u2019s thesis, Universit\u00e4t Duisburg-Essen"},{"key":"2363_CR34","first-page":"269","volume":"23","author":"M Mohri","year":"1997","unstructured":"Mohri M (1997) Finite-state transducers in language and speech processing. Comput Linguist 23:269\u2013311","journal-title":"Comput Linguist"},{"key":"2363_CR35","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-3-642-01492-5_6","volume-title":"Handbook of weighted automata","author":"M Mohri","year":"2009","unstructured":"Mohri M (2009) Weighted automata algorithms. In: Droste M, Kuich W, Vogler H (eds) Handbook of weighted automata. Springer, Berlin, pp 213\u2013254"},{"issue":"1","key":"2363_CR36","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0304-3975(80)90038-9","volume":"11","author":"M Morisaki","year":"1980","unstructured":"Morisaki M, Sakai K (1980) A complete axiom system for rational sets with multiplicity. Theor Comput Sci 11(1):79\u201392","journal-title":"Theor Comput Sci"},{"key":"2363_CR37","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/978-3-642-01492-5_12","volume-title":"Handbook of weighted automata","author":"G Rahonis","year":"2009","unstructured":"Rahonis G (2009) Fuzzy languages. In: Droste M, Kuich W, Vogler H (eds) Handbook of weighted automata. Springer, Berlin, pp 481\u2013517"},{"key":"2363_CR38","doi-asserted-by":"publisher","unstructured":"Rot J, Bonchi F, Bonsangue M, Pous D, Rutten J, Silva A (2015) Enhanced coalgebraic bisimulation. Math Struct Comput Sci. doi: 10.1017\/S0960129515000523","DOI":"10.1017\/S0960129515000523"},{"key":"2363_CR39","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"JJMM Rutten","year":"2000","unstructured":"Rutten JJMM (2000) Universal coalgebra: a theory of systems. Theor Comput Sci 249:3\u201380","journal-title":"Theor Comput Sci"},{"key":"2363_CR40","doi-asserted-by":"crossref","unstructured":"Sakarovitch J (2009) Rational and recognisable power series. In: Droste M, Kuich W, Vogler H (eds) Handbook of weighted automata. Springer, Berlin, pp 105\u2013174","DOI":"10.1007\/978-3-642-01492-5_4"},{"issue":"2\u20133","key":"2363_CR41","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M-P Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger M-P (1961) On the definition of a family of automata. Inf Control 4(2\u20133):245\u2013270","journal-title":"Inf Control"},{"key":"2363_CR42","doi-asserted-by":"crossref","unstructured":"Staton S (2009) Relating coalgebraic notions of bisimulation. In: Proceedings of CALCO \u201909, LNCS 5728. Springer, pp 191\u2013205","DOI":"10.1007\/978-3-642-03741-2_14"},{"key":"2363_CR43","doi-asserted-by":"crossref","unstructured":"Urabe N, Hasuo I (2014) Generic forward and backward simulations III: quantitative simulations by matrices. In: Proceedings of CONCUR \u201914, LNCS\/ARCoSS 8704. Springer, pp 451\u2013466","DOI":"10.1007\/978-3-662-44584-6_31"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2363-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2363-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2363-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T20:27:06Z","timestamp":1568406426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2363-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,26]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["2363"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2363-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2016,9,26]]}}}