{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:05Z","timestamp":1759638845615},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662534120"},{"type":"electronic","value":"9783662534137"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53413-7_2","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T07:57:11Z","timestamp":1472543831000},"page":"23-38","source":"Crossref","is-referenced-by-count":4,"title":["Quantitative Monitor Automata"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Otop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/978-3-642-54862-8_37","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Almagor","year":"2014","unstructured":"Almagor, S., Boker, U., Kupferman, O.: Discounting in LTL. In: \\\u2019{A}brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014 (ETAPS). LNCS, vol. 8413, pp. 424\u2013439. Springer, Heidelberg (2014)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., D\u2019Antoni, L., Deshmukh, J.V., Raghothaman, M., Yuan, Y.: Regular functions and cost register automata. In: LICS 2013, pp. 13\u201322 (2013)","DOI":"10.1109\/LICS.2013.65"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Baier, C., Dubslaff, C., Kl\u00fcppelholz, S.: Trade-off analysis meets probabilistic model checking. In: CSL-LICS 2014, pp. 1:1\u20131:10 (2014)","DOI":"10.1145\/2603088.2603089"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Baier, C., Klein, J., Kl\u00fcppelholz, S., Wunderlich, S.: Weight monitoring with linear temporal logic: complexity and decidability. In: CSL-LICS 2014, pp. 11:1\u201311:10 (2014)","DOI":"10.1145\/2603088.2603162"},{"issue":"4","key":"2_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2629686","volume":"15","author":"U Boker","year":"2014","unstructured":"Boker, U., Chatterjee, K., Henzinger, T.A., Kupferman, O.: Temporal specifications with accumulative values. ACM TOCL 15(4), 1\u201325 (2014)","journal-title":"ACM TOCL"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/978-3-642-14162-1_49","volume-title":"Automata, Languages and Programming","author":"B Bollig","year":"2010","unstructured":"Bollig, B., Gastin, P., Monmege, B., Zeitoun, M.: Pebble weighted automata and transitive closure logics. In: Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G., Abramsky, S. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 587\u2013598. Springer, Heidelberg (2010)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/978-3-662-44584-6_19","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"P Bouyer","year":"2014","unstructured":"Bouyer, P., Markey, N., Matteplackel, R.M.: Averaging in LTL. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 266\u2013280. Springer, Heidelberg (2014)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Brozek, V., Chatterjee, K., Forejt, V., Kucera, A.: Two views on multiple mean-payoff objectives in Markov decision processes. In: LICS 2011, pp. 33\u201342 (2011)","DOI":"10.1109\/LICS.2011.10"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Forejt, V., Kucera, A.: Multigain: a controller synthesis tool for MDPs with multiple mean-payoff objectives. In: TACAS 2015, pp. 181\u2013187 (2015)","DOI":"10.1007\/978-3-662-46681-0_12"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/978-3-540-77050-3_39","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"K Chatterjee","year":"2007","unstructured":"Chatterjee, K.: Markov decision processes with multiple long-run average objectives. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 473\u2013484. Springer, Heidelberg (2007)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/978-3-642-22993-0_21","volume-title":"Mathematical Foundations of Computer Science 2011","author":"K Chatterjee","year":"2011","unstructured":"Chatterjee, K., Doyen, L.: Energy and mean-payoff parity Markov decision processes. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 206\u2013218. Springer, Heidelberg (2011)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/978-3-642-15375-4_19","volume-title":"CONCUR 2010 - Concurrency Theory","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T.A., Rannou, P.: Mean-payoff automaton expressions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 269\u2013283. Springer, Heidelberg (2010)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. LMCS, 6(3) (2010)","DOI":"10.2168\/LMCS-6(3:10)2010"},{"issue":"4","key":"2_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/1805950.1805953","volume":"11","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. ACM TOCL 11(4), 23 (2010)","journal-title":"ACM TOCL"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/978-3-642-45221-5_17","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K Chatterjee","year":"2013","unstructured":"Chatterjee, K., Forejt, V., Wojtczak, D.: Multi-objective discounted reward verification in graphs and MDPs. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR-19 2013. LNCS, vol. 8312, pp. 228\u2013242. Springer, Heidelberg (2013)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Otop, J.: Nested weighted limit-average automata of bounded width. To appear at MFCS 2016 (2016)","DOI":"10.1109\/LICS.2015.72"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Otop, J.: Quantitative automata under probabilistic semantics. To appear at LICS 2016 (2016)","DOI":"10.1145\/2933575.2933588"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Otop, J.: Nested weighted automata. In: LICS 2015, pp. 725\u2013737 (2015)","DOI":"10.1109\/LICS.2015.72"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Kom\u00e1rkov\u00e1, Z., Kret\u00ednsk\u00fd, J.: Unifying two views on multiple mean-payoff objectives in Markov Decision Processes. In: LICS 2015, pp. 244\u2013256 (2015)","DOI":"10.1109\/LICS.2015.32"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/11672142_26","volume-title":"STACS 2006","author":"K Chatterjee","year":"2006","unstructured":"Chatterjee, K., Majumdar, R., Henzinger, T.A.: Markov decision processes with multiple objectives. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 325\u2013336. Springer, Heidelberg (2006)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-3-642-15205-4_22","volume-title":"Computer Science Logic","author":"A Degorre","year":"2010","unstructured":"Degorre, A., Doyen, L., Gentilini, R., Raskin, J.-F., Toru\u0144czyk, S.: Energy and mean-payoff games with imperfect information. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 260\u2013274. Springer, Heidelberg (2010)"},{"key":"2_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer, Heidelberg (2009)","edition":"1"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"2_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4054-9","volume-title":"Competitive Markov Decision Processes","author":"J Filar","year":"1996","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, New York (1996)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-642-19835-9_11","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"V Forejt","year":"2011","unstructured":"Forejt, V., Kwiatkowska, M., Norman, G., Parker, D., Qu, H.: Quantitative multi-objective verification for probabilistic systems. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 112\u2013127. Springer, Heidelberg (2011)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Pnueli, A., The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, pp. 46\u201357. IEEE (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"2_CR27","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"1994","unstructured":"Puterman, M.L., Processes, M.D.: Discrete Stochastic Dynamic Programming, 1st edn. Wiley, New York (1994)","edition":"1"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol. b, pp. 133\u2013191. MIT Press, Cambridge (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53413-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T06:41:24Z","timestamp":1657176084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53413-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534120","9783662534137"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53413-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}