{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:14Z","timestamp":1759637594181,"version":"3.41.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,10,27]],"date-time":"2015-10-27T00:00:00Z","timestamp":1445904000000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s00224-015-9658-9","type":"journal-article","created":{"date-parts":[[2015,10,27]],"date-time":"2015-10-27T07:13:17Z","timestamp":1445929997000},"page":"231-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Multi-weighted Automata and MSO Logic"],"prefix":"10.1007","volume":"59","author":[{"given":"Manfred","family":"Droste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Perevoshchikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,27]]},"reference":[{"key":"9658_CR1","unstructured":"Andersson, D.: Improved combinatorial algorithms for discounted payoff games. Master\u2019s thesis Up-psala University, Department of Information Technology (2006)"},{"key":"9658_CR2","doi-asserted-by":"crossref","unstructured":"Bauer, S., Juhl, L., Larsen, K., Legay, A., Srba, J.: A logic for accumulated-weight reasoning on multiweighted modal automata Im: TASE 2012, pp. 77\u201384. IEEE (2012)","DOI":"10.1109\/TASE.2012.9"},{"key":"9658_CR3","doi-asserted-by":"crossref","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs on Theoretical Computer Science, vol. 12. Springer (1988)","DOI":"10.1007\/978-3-642-73235-5"},{"key":"9658_CR4","doi-asserted-by":"crossref","unstructured":"Bloem, R., Greimel, K., Henzinger, T.A., Jobstmann, B.: Synthesizing robust systems, pp. 85\u201392 (2009)","DOI":"10.1109\/FMCAD.2009.5351139"},{"key":"9658_CR5","first-page":"18","volume-title":"DLT 2009.LNCS, vol. 5583","author":"B Bollig","year":"2009","unstructured":"Bollig, B., Gastin, P.: Weighted versus probabilistic logics. In: DLT 2009.LNCS, vol. 5583, pp. 18\u201338. Springer, Heidelberg (2009)"},{"key":"9658_CR6","doi-asserted-by":"crossref","unstructured":"Bollig, B., Gastin, P., Monmege, B., Zeitoun, M.: Logical characterization of weighted pebble walking automata. In: CSL\/LICS\u201914. ACM Press (2014)","DOI":"10.1145\/2603088.2603118"},{"key":"9658_CR7","first-page":"203","volume-title":"HSCC 2004. LNCS, vol. 2993","author":"P Bouyer","year":"2004","unstructured":"Bouyer, P., Brinksma, E., Larsen, K.G.: Staying alive as cheaply as possible. In: HSCC 2004. LNCS, vol. 2993, pp. 203\u2013218. Springer, Heidelberg (2004)"},{"key":"9658_CR8","doi-asserted-by":"crossref","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":"9658_CR9","doi-asserted-by":"crossref","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":"9658_CR10","first-page":"407","volume-title":"LATIN 2000. LNCS, vol. 1776","author":"O Carton","year":"2000","unstructured":"Carton, O., Michel, M.: Unambiguous B\u00fcchi automata. In: LATIN 2000. LNCS, vol. 1776, pp. 407\u2013416. Springer, Heidelberg (2000)"},{"key":"9658_CR11","first-page":"385","volume-title":"CSL 2008. LNCS, vol. 5213","author":"K Chatterjee","year":"2008","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. In: CSL 2008. LNCS, vol. 5213, pp. 385\u2013400. Springer, Heidelberg (2008)"},{"key":"9658_CR12","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. Logical Methods in Comp. Sci, vol. 6 (2010)","DOI":"10.2168\/LMCS-6(3:10)2010"},{"issue":"1-2","key":"9658_CR13","doi-asserted-by":"crossref","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-2), 69\u201386 (2007)","journal-title":"Theoret. Comp. Sci"},{"key":"9658_CR14","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. In: Droste, M., Kuich, W., Vogler, H. (eds.) [15] chapter 5"},{"key":"9658_CR15","doi-asserted-by":"crossref","unstructured":"In: 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":"9658_CR16","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuske, D.: Skew and infinitary formal power series, vol. 2719, pp. 426\u2013438. Springer (2003)","DOI":"10.1007\/3-540-45061-0_35"},{"key":"9658_CR17","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.ic.2012.10.001","volume":"220-221","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-221, 44\u201359 (2012)","journal-title":"Inf. Comput"},{"key":"9658_CR18","first-page":"418","volume-title":"CSR 2013. LNCS, vol. 7913","author":"M Droste","year":"2013","unstructured":"Droste, M., Perevoshchikov, V.: Multi-weighted automata and MSO logic. In: CSR 2013. LNCS, vol. 7913, pp. 418\u2013430. Springer, Heidelberg (2013)"},{"key":"9658_CR19","doi-asserted-by":"crossref","unstructured":"Droste, M., Perevoshchikov, V.: A Nivat theorem for weighted timed automata and relative distance logic, vol. 8573, pp. 171\u2013182. Springer (2009)","DOI":"10.1007\/978-3-662-43951-7_15"},{"key":"9658_CR20","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.tcs.2011.11.008","volume":"418","author":"M Droste","year":"2012","unstructured":"Droste, M., Vogler, H.: Weighted automata and multi-valued logics over arbitrary bounded lattices. Theoret. Comp. Science 418, 14\u201336 (2012)","journal-title":"Theoret. Comp. Science"},{"key":"9658_CR21","volume-title":"Automata, Languages and Machines, volume A","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, volume A. Academic Press, New York (1974)"},{"key":"9658_CR22","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"CC Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc 98, 21\u201351 (1961)","journal-title":"Trans. Amer. Math. Soc"},{"key":"9658_CR23","doi-asserted-by":"crossref","unstructured":"Fahrenberg, U., Juhl, L., Larsen, K.G., Srba, J.: Energy games in multiweighted automata. In: ICTAC 2011. LNCS, vol. 6916, pp. 95\u2013115. Springer (2011)","DOI":"10.1007\/978-3-642-23283-1_9"},{"key":"9658_CR24","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.entcs.2009.05.039","volume":"239","author":"U Fahrenberg","year":"2009","unstructured":"Fahrenberg, U., Larsen, K.G.: Discount-optimal infinite runs in priced timed automata. Electr. Notes Theor. Comput. Sci 239, 179\u2013191 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci"},{"key":"9658_CR25","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.entcs.2009.10.003","volume":"253","author":"U Fahrenberg","year":"2009","unstructured":"Fahrenberg, U., Larsen, K.G.: Discounting in time. Electr. Notes Theor. Comput. Sci 253, 25\u201331 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci"},{"key":"9658_CR26","doi-asserted-by":"crossref","unstructured":"Fahrenberg, U., Larsen, K.G., Thrane, C.R.: Model-based verification and analysis for real-time systems. In: Software and Systems Safety - Specification and Verification. NATO Science for Peace and Security Series - D: Information and Communication Securita, vol. 30, pp. 231\u2013259. IOS Press (2011)","DOI":"10.3233\/978-1-60750-711-6-231"},{"key":"9658_CR27","doi-asserted-by":"crossref","unstructured":"Filiot, E., Gentilini, R., Raskin, J.-F.: Quantitative languages defined by functional automata. In: CONCUR 2012. LNCS, vol. 7454, pp. 132\u2013146. Springer (2012)","DOI":"10.1007\/978-3-642-32940-1_11"},{"key":"9658_CR28","doi-asserted-by":"crossref","unstructured":"Fr\u00e4nzle, M., Swaminathan, M. In: Ouaknine, J., Vaandrager, F.W (eds.) : Revisiting decidability and optimum reachability for multi-priced timed automata, vol. 5813, pp. 149\u2013163. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-04368-0_13"},{"key":"9658_CR29","doi-asserted-by":"crossref","unstructured":"Kuich, W.: Semirings and formal power series: their relevance to formal languages and automata. In: Handbook of Formal Languages, vol. 1, pp. 609\u2013677. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_9"},{"key":"9658_CR30","doi-asserted-by":"crossref","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata and Languages. EATCS Monographs on Theoretical Computer Science, vol. 5. Springer (1986)","DOI":"10.1007\/978-3-642-69959-7_2"},{"key":"9658_CR31","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Rasmussen, J.I.: Optimal conditional reachability for multi-priced timed automata. In: FOSSACS 2005. LNCS, vol. 3441, pp. 234\u2013249. Springer (2005)","DOI":"10.1007\/978-3-540-31982-5_15"},{"key":"9658_CR32","doi-asserted-by":"crossref","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective functions. In: STOC 1978. ACM, pp. 1\u201312 (1978)","DOI":"10.1145\/800133.804326"},{"key":"9658_CR33","doi-asserted-by":"crossref","unstructured":"Puri, A., Tripakis, S.: Algorithms for the multi-constrained routing problem, vol. 2368, pp. 338\u2013347. Springer (2002)","DOI":"10.1007\/3-540-45471-3_35"},{"key":"9658_CR34","doi-asserted-by":"crossref","unstructured":"Quaas, K.: MSO Logics for Weighted Timed Automata. Formal Methods in System Design, vol. 38 (2011)","DOI":"10.1007\/s10703-011-0112-6"},{"key":"9658_CR35","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Rational and recognisable power series. In: Droste, M., Kuich, W., Vogler, H. (eds.) [15] chapter 4","DOI":"10.1007\/978-3-642-01492-5_4"},{"key":"9658_CR36","doi-asserted-by":"crossref","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Text and Monographs in Computer Science. Springer (1978)","DOI":"10.1007\/978-1-4612-6264-0"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9658-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-015-9658-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9658-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:50:44Z","timestamp":1748667044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-015-9658-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,27]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9658"],"URL":"https:\/\/doi.org\/10.1007\/s00224-015-9658-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2015,10,27]]}}}