{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:00:17Z","timestamp":1762459217744},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44602-7_24","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:18:40Z","timestamp":1408756720000},"page":"311-325","source":"Crossref","is-referenced-by-count":4,"title":["Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata"],"prefix":"10.1007","author":[{"given":"Barbara","family":"K\u00f6nig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"K\u00fcpper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_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.\u00a07213, pp. 58\u201373. Springer, Heidelberg (2012)"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-24372-1_37","volume-title":"Automated Technology for Verification and Analysis","author":"S. Almagor","year":"2011","unstructured":"Almagor, S., Boker, U., Kupferman, O.: What\u2019s decidable about weighted automata? In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol.\u00a06996, pp. 482\u2013491. Springer, Heidelberg (2011)"},{"key":"24_CR3","unstructured":"Ad\u00e1mek, J., Herrlich, H., Strecker, G.E.: Abstract and Concrete Categories - The Joy of Cats. Wiley (1990)"},{"key":"24_CR4","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. Theoretical Computer Science\u00a0150, 57\u201375 (1995)","journal-title":"Theoretical Computer Science"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Ad\u00e1mek, J., Rosick\u00fd, J.: Locally Presentable and Accessible Categories. London Mathematical Society Lecture Note Series, vol.\u00a0189. Cambridge University Press (1994)","DOI":"10.1017\/CBO9780511600579"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-61474-5_57","volume-title":"Computer Aided Verification","author":"C. Baier","year":"1996","unstructured":"Baier, C.: Polynomial time algorithms for testing probabilistic bisimulation and simulation. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 50\u201361. Springer, Heidelberg (1996)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/11753728_9","volume-title":"Computer Science \u2013 Theory and Applications","author":"M.-P. B\u00e9al","year":"2006","unstructured":"B\u00e9al, M.-P., Lombardy, S., Sakarovitch, J.: Conjugacy and equivalence of weighted automata and functional transducers. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 58\u201369. Springer, Heidelberg (2006)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Bonsangue, M., Milius, S., Silva, A.: Sound and complete axiomatizations of coalgebraic language equivalence. ACM Transactions on Computational Logic\u00a014(1) (2013)","DOI":"10.1145\/2422085.2422092"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-04081-8_12","volume-title":"CONCUR 2009 - Concurrency Theory","author":"M. Boreale","year":"2009","unstructured":"Boreale, M.: Weighted bisimulation in linear algebraic form. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 163\u2013177. Springer, Heidelberg (2009)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Petrisan, D., Pous, D., Rot, J.: Coinduction up to in a fibrational setting. CoRR abs\/1401.6675 (2014)","DOI":"10.1145\/2603088.2603149"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and their Languages. Springer (1988)","DOI":"10.1007\/978-3-642-73235-5"},{"key":"24_CR12","unstructured":"Droste, M., Kuske, D.: Weighted automata. To appear in Automata: from Mathematics to Applications. European Mathematical Society (2013)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Droste, M., Werner, K., Vogler, H.: Handbook of Weighted Automata. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Mohri, M.: Weighted automata algorithms. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, pp. 213\u2013254. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5_6"},{"key":"24_CR15","unstructured":"\u00c9sik, Z., Maletti, A.: Simulation vs. equivalence. In: Proc. of FCS 2010, pp. 119\u2013124 (2010)"},{"issue":"2-3","key":"24_CR16","doi-asserted-by":"publisher","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.: Coalgebraic minimization of HD-automata for the \u03c0-calculus using polymorphic types. Theor. Comput. Sci.\u00a0331(2-3), 325\u2013365 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4:11","key":"24_CR17","first-page":"1","volume":"3","author":"I. Hasuo","year":"2007","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Logical Methods in Computer Science\u00a03(4:11), 1\u201336 (2007)","journal-title":"Logical Methods in Computer Science"},{"key":"24_CR18","volume-title":"Introduction to automata theory, languages and computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computation. Addison Wesley, Reading (1979)"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-642-22110-1_42","volume-title":"Computer Aided Verification","author":"S. Kiefer","year":"2011","unstructured":"Kiefer, S., Murawski, A.S., Ouaknine, J., Wachter, B., Worrell, J.: Language equivalence for probabilistic automata. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 526\u2013540. Springer, Heidelberg (2011)"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-55719-9_67","volume-title":"Automata, Languages and Programming","author":"D. Krob","year":"1992","unstructured":"Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 101\u2013112. Springer, Heidelberg (1992)"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing (preliminary report). In: Proc. of POPL 1989, pp. 344\u2013352. ACM (1989)","DOI":"10.1145\/75277.75307"},{"key":"24_CR22","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics\u00a023, 269\u2013311 (1997)","journal-title":"Computational Linguistics"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Mohri, M.: Weighted automata algorithms. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, pp. 213\u2013254. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5_6"},{"key":"24_CR24","unstructured":"Rot, J., Bonchi, F., Bonsangue, M., Rutten, J., Pous, D., Silva, A.: Enhanced coalgebraic bisimulation. In: Mathematical Structures in Computer Science (to appear, 2014)"},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science\u00a0249, 3\u201380 (2000)","journal-title":"Theoretical Computer Science"},{"key":"24_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-03741-2_14","volume-title":"Algebra and Coalgebra in Computer Science","author":"S. Staton","year":"2009","unstructured":"Staton, S.: Relating coalgebraic notions of bisimulation. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol.\u00a05728, pp. 191\u2013205. Springer, Heidelberg (2009)"},{"key":"24_CR27","unstructured":"Urabe, N., Hasuo, I.: Generic forward and backward simulations III: Quantitative simulations by matrices. In: Proc. of CONCUR 2014. LNCS\/ARCoSS. Springer (to appear, 2014)"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44602-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T06:36:09Z","timestamp":1565764569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44602-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44602-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}