{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:59:30Z","timestamp":1725728370805},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_36","type":"book-chapter","created":{"date-parts":[[2013,6,2]],"date-time":"2013-06-02T21:03:04Z","timestamp":1370206984000},"page":"418-430","source":"Crossref","is-referenced-by-count":5,"title":["Multi-weighted Automata and MSO Logic"],"prefix":"10.1007","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","reference":[{"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. In: Proc. of the 6th Int. Symp. on Theoret. Aspects of Software Engineering (TASE 2012), pp. 77\u201384. IEEE Computer Society Press (2012)","key":"36_CR1","DOI":"10.1109\/TASE.2012.9"},{"doi-asserted-by":"crossref","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs on Theoretical Computer Science, vol.\u00a012. Springer (1988)","key":"36_CR2","DOI":"10.1007\/978-3-642-73235-5"},{"doi-asserted-by":"crossref","unstructured":"Bloem, R., Greimel, K., Henzinger, T.A., Jobstmann, B.: Synthesizing robust systems. In: Proc. of 9th Int. Conf. on Formal Methods in Computer-Aided Design (FMCAD 2009), pp. 85\u201392. IEEE (2009)","key":"36_CR3","DOI":"10.1109\/FMCAD.2009.5351139"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-02737-6_2","volume-title":"Developments in Language Theory","author":"B. Bollig","year":"2009","unstructured":"Bollig, B., Gastin, P.: Weighted versus probabilistic logics. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 18\u201338. Springer, Heidelberg (2009)"},{"issue":"1","key":"36_CR5","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\u00a032(1), 3\u201323 (2008)","journal-title":"Formal Methods in System Design"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-24743-2_14","volume-title":"Hybrid Systems: Computation and Control","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P., Brinksma, E., Larsen, K.G.: Staying alive as cheaply as possible. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol.\u00a02993, pp. 203\u2013218. Springer, Heidelberg (2004)"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik und Grundl. Math.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik und Grundl. Math."},{"key":"36_CR8","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.\u00a05213, pp. 385\u2013400. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. Logical Methods in Comp. Sci.\u00a06(3) (2010)","key":"36_CR9","DOI":"10.2168\/LMCS-6(3:10)2010"},{"unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. In: Droste et.al.: [11], ch. 5","key":"36_CR10"},{"doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs on Theoretical Computer Science. Springer (2009)","key":"36_CR11","DOI":"10.1007\/978-3-642-01492-5"},{"issue":"1-2","key":"36_CR12","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.\u00a0380(1-2), 69\u201386 (2007)","journal-title":"Theoret. Comp. Sci."},{"issue":"8","key":"36_CR13","doi-asserted-by":"publisher","first-page":"1829","DOI":"10.1142\/S0129054111009069","volume":"22","author":"M. Droste","year":"2011","unstructured":"Droste, M., Meinecke, I.: Weighted automata and regular expressions over valuation monoids. Int. J. Found. Comput. Sci.\u00a022(8), 1829\u20131844 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ic.2012.10.001","volume":"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.\u00a0221, 44\u201359 (2012)","journal-title":"Inf. Comput."},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"C.C. Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc.\u00a098, 21\u201351 (1961)","journal-title":"Trans. Amer. Math. Soc."},{"key":"36_CR16","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.\u00a06916, pp. 95\u2013115. Springer, Heidelberg (2011)"},{"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 Security, vol.\u00a030, pp. 231\u2013259. IOS Press (2011)","key":"36_CR17"},{"key":"36_CR18","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.\u00a07454, pp. 132\u2013146. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata and Languages. EATCS Monographs on Theoretical Computer Science, vol.\u00a05. Springer (1986)","key":"36_CR19","DOI":"10.1007\/978-3-642-69959-7_2"},{"key":"36_CR20","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":"K.G. 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.\u00a03441, pp. 234\u2013249. Springer, Heidelberg (2005)"},{"issue":"3","key":"36_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10703-011-0112-6","volume":"38","author":"K. Quaas","year":"2011","unstructured":"Quaas, K.: MSO logics for weighted timed automata. Form. Methods Syst. Des.\u00a038(3), 193\u2013222 (2011)","journal-title":"Form. Methods Syst. Des."},{"doi-asserted-by":"crossref","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer (1978)","key":"36_CR22","DOI":"10.1007\/978-1-4612-6264-0"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:27:29Z","timestamp":1557750449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}