{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:33Z","timestamp":1759637553439},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_15","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T04:37:49Z","timestamp":1402461469000},"page":"171-182","source":"Crossref","is-referenced-by-count":10,"title":["A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance 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":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Triverdi, A.: Relating average and discounted costs for quantitative analysis of timed systems. In: EMSOFT 2011, pp. 165\u2013174. IEEE (2011)","DOI":"10.1145\/2038642.2038668"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-45351-2_8","volume-title":"Hybrid Systems: Computation and Control","author":"R. Alur","year":"2001","unstructured":"Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, pp. 49\u201362. Springer, Heidelberg (2001)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45351-2_15","volume-title":"Hybrid Systems: Computation and Control","author":"G. Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K.G., Petterson, P., Romijn, J., Vaandrager, F.: Minimum-cost reachability for priced timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, pp. 147\u2013161. Springer, Heidelberg (2001)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner Studienb\u00fccher: Informatik. Teubner, Stuttgart (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs on Theoretical Computer Science, vol.\u00a012. Springer (1988)","DOI":"10.1007\/978-3-642-73235-5"},{"key":"15_CR7","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":"15_CR8","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, 3\u201323 (2008)","journal-title":"Formal Methods in System Design"},{"key":"15_CR9","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."},{"issue":"1-2","key":"15_CR10","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."},{"key":"15_CR11","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. In: Droste, M., Kuich, W., Vogler, H. (eds.) [12], ch. 5"},{"key":"15_CR12","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":"15_CR13","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":"15_CR14","doi-asserted-by":"publisher","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.\u00a0220-221, 44\u201359 (2012)","journal-title":"Inf. Comput."},{"key":"15_CR15","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.\u00a07913, pp. 418\u2013430. Springer, Heidelberg (2013)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-14455-4_16","volume-title":"Developments in Language Theory","author":"M. Droste","year":"2010","unstructured":"Droste, M., Vogler, H.: Kleene and B\u00fcchi theorems for weighted automata and multi-valued logic over arbitrary bounded lattices. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 160\u2013172. Springer, Heidelberg (2010)"},{"key":"15_CR17","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A. Academic Press, New York (1974)"},{"key":"15_CR18","doi-asserted-by":"publisher","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.\u00a0239, 179\u2013191 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"15_CR19","doi-asserted-by":"publisher","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.\u00a0253, 25\u201331 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata and Languages. EATCS Monographs on Theoretical Computer Science, vol.\u00a05. Springer (1986)","DOI":"10.1007\/978-3-642-69959-7_2"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-44585-4_47","volume-title":"Computer Aided Verification","author":"K.G. Larsen","year":"2001","unstructured":"Larsen, K.G., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., Romijn, J.: As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 493\u2013505. Springer, Heidelberg (2001)"},{"key":"15_CR22","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)"},{"key":"15_CR23","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\u00a018, 339\u2013456 (1968)","journal-title":"Ann. de L\u2019Inst. Fourier"},{"key":"15_CR24","unstructured":"Quaas, K.: Kleene-Sch\u00fctzenberger and B\u00fcchi theorems for weighted timed automata. PhD thesis, Universit\u00e4t Leipzig (2010)"},{"issue":"3","key":"15_CR25","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. Formal Methods in System Design\u00a038(3), 193\u2013222 (2011)","journal-title":"Formal Methods in System Design"},{"key":"15_CR26","unstructured":"Wilke, T.: Automaten und Logiken zur Beschreibung zeitabh\u00e4ngiger Systeme. PhD thesis, Christian-Albrecht-Universit\u00e4t Kiel (1994)"},{"key":"15_CR27","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.\u00a0863, pp. 694\u2013715. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:27:50Z","timestamp":1558909670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}