{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:51:34Z","timestamp":1742993494881,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_33","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"413-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Weight Assignment Logic"],"prefix":"10.1007","author":[{"given":"Vitaly","family":"Perevoshchikov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"key":"33_CR1","unstructured":"Andersson, D.: Improved combinatorial algorithms for discounted payoff games. Master\u2019s thesis, Uppsala University, Department of Information Technology (2006)"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Bloem, R., Greimel, K., Henzinger, T.A., Jobstmann, B.: Synthesizing robust systems. In: FMCAD 2009, pp. 85\u201392. IEEE (2009)","DOI":"10.1109\/FMCAD.2009.5351139"},{"issue":"2","key":"33_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(02)00229-6","volume":"84","author":"P Bouyer","year":"2002","unstructured":"Bouyer, P.: A logical characterization of data languages. Inf. Process. Lett. 84(2), 75\u201385 (2002)","journal-title":"Inf. Process. Lett."},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10703-007-0043-4","volume":"32","author":"P Bouyer","year":"2008","unstructured":"Bouyer, P., Brinksma, E., Larsen, K.G.: Optimal infinite scheduling for multi-priced timed automata. Formal Methods in System Design 32, 3\u201323 (2008)","journal-title":"Formal Methods in System Design"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"JR B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik und Grundl. Math. 6, 66\u201392 (1960)","journal-title":"Z. Math. Logik und Grundl. Math."},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-87531-4_28","volume-title":"Computer Science Logic","author":"K Chatterjee","year":"2008","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 385\u2013400. Springer, Heidelberg (2008)"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/10719839_40","volume-title":"LATIN 2000: Theoretical Informatics","author":"O Carton","year":"2000","unstructured":"Carton, O., Michel, M.: Unambiguous B\u00fcchi automata. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 407\u2013416. Springer, Heidelberg (2000)"},{"issue":"1\u20132","key":"33_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2007.02.055","volume":"380","author":"M Droste","year":"2007","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. Theoret. Comp. Sci. 380(1\u20132), 69\u201386 (2007)","journal-title":"Theoret. Comp. Sci."},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs on Theoretical Computer Science. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5"},{"key":"33_CR10","unstructured":"Droste, M., Kuske, D.: Weighted automata. In: Pin, J.-E. (ed.) Handbook: \u201cAutomata: from Mathematics to Applications\u201d. European Mathematical Society (to appear)"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ic.2012.10.001","volume":"220\u2013221","author":"M Droste","year":"2012","unstructured":"Droste, M., Meinecke, I.: Weighted automata and weighted MSO logics for average and long-time behaviors. Inf. Comput. 220\u2013221, 44\u201359 (2012)","journal-title":"Inf. Comput."},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-642-38536-0_36","volume-title":"Computer Science \u2013 Theory and Applications","author":"M Droste","year":"2013","unstructured":"Droste, M., Perevoshchikov, V.: Multi-weighted automata and MSO logic. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 418\u2013430. Springer, Heidelberg (2013)"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-662-43951-7_15","volume-title":"Automata, Languages, and Programming","author":"M Droste","year":"2014","unstructured":"Droste, M., Perevoshchikov, V.: A Nivat theorem for weighted timed automata and weighted relative distance logic. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 171\u2013182. Springer, Heidelberg (2014)"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11779148_6","volume-title":"Developments in Language Theory","author":"M Droste","year":"2006","unstructured":"Droste, M., Rahonis, G.: Weighted automata and weighted logics on infinite words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 49\u201358. Springer, Heidelberg (2006)"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-23283-1_9","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2011","author":"U Fahrenberg","year":"2011","unstructured":"Fahrenberg, U., Juhl, L., Larsen, K.G., Srba, J.: Energy games in multiweighted automata. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC 2011. LNCS, vol. 6916, pp. 95\u2013115. Springer, Heidelberg (2011)"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-32940-1_11","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"E Filiot","year":"2012","unstructured":"Filiot, E., Gentilini, R., Raskin, J.-F.: Quantitative languages defined by functional automata. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 132\u2013146. Springer, Heidelberg (2012)"},{"issue":"3","key":"33_CR17","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1142\/S0218196702000845","volume":"12","author":"K Hashiguchi","year":"2002","unstructured":"Hashiguchi, K., Ishiguro, K., Jimbo, S.: Decidability of the equivalence problem for finitely ambiguous finance automata. Int. Journal of Algebra and Computation 12(3), 445\u2013461 (2002)","journal-title":"Int. Journal of Algebra and Computation"},{"issue":"3","key":"33_CR18","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1142\/S0218196794000063","volume":"4","author":"D Krob","year":"1994","unstructured":"Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. International Journal of Algebra and Computation 4(3), 405\u2013425 (1994)","journal-title":"International Journal of Algebra and Computation"},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-31982-5_15","volume-title":"Foundations of Software Science and Computational Structures","author":"KG Larsen","year":"2005","unstructured":"Larsen, K.G., Rasmussen, J.I.: Optimal conditional reachability for multi-priced timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 234\u2013249. Springer, Heidelberg (2005)"},{"key":"33_CR20","doi-asserted-by":"publisher","first-page":"339","DOI":"10.5802\/aif.287","volume":"18","author":"M Nivat","year":"1968","unstructured":"Nivat, M.: Transductions des langages de Chomsky. Ann. de l\u2019Inst. Fourier 18, 339\u2013456 (1968)","journal-title":"Ann. de l\u2019Inst. Fourier"},{"issue":"2","key":"33_CR21","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1142\/S012905410900653X","volume":"20","author":"T St\u00fcber","year":"2009","unstructured":"St\u00fcber, T., Vogler, H., F\u00fcl\u00f6p, Z.: Decomposition of weighted multioperator tree automata. Int. J. Foundations of Computer Sci. 20(2), 221\u2013245 (2009)","journal-title":"Int. J. Foundations of Computer Sci."},{"key":"33_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/3-540-58468-4_191","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"T Wilke","year":"1994","unstructured":"Wilke, T.: Specifying timed state sequences in powerful decidable logics and timed automata. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol. 863, pp. 694\u2013715. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T13:12:50Z","timestamp":1676466770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}