{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:24:22Z","timestamp":1742937862354,"version":"3.40.3"},"publisher-location":"Cham","reference-count":74,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030897154"},{"type":"electronic","value":"9783030897161"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89716-1_1","type":"book-chapter","created":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T13:08:02Z","timestamp":1635167282000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Quantitative vs. Weighted Automata"],"prefix":"10.1007","author":[{"given":"Udi","family":"Boker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,22]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 424\u2013439. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_37"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Almagor, S., Boker, U., Kupferman, O.: Formalizing and reasoning about quality. J. ACM 63(3), 24:1\u201324:56 (2016)","DOI":"10.1145\/2875421"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-24372-1_37","volume-title":"Automated Technology for Verification and Analysis","author":"S Almagor","year":"2011","unstructured":"Almagor, S., Boker, U., Kupferman, O.: What\u2019s decidable about weighted automata? In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 482\u2013491. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24372-1_37"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-24372-1_2","volume-title":"Automated Technology for Verification and Analysis","author":"S Almagor","year":"2011","unstructured":"Almagor, S., Kupferman, O.: Max and sum semantics for alternating weighted automata. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 13\u201327. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24372-1_2"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-319-63390-9_19","volume-title":"Computer Aided Verification","author":"S Almagor","year":"2017","unstructured":"Almagor, S., Kupferman, O., Ringert, J.O., Velner, Y.: Quantitative assume guarantee synthesis. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 353\u2013374. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_19"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Aminof, B., Kupferman, O., Lampert, R.: Reasoning about online algorithms with weighted automata. ACM Trans. Algorithms 6(2), 28:1\u201328:36 (2010)","DOI":"10.1145\/1721837.1721844"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.tcs.2013.02.005","volume":"480","author":"B Aminof","year":"2013","unstructured":"Aminof, B., Kupferman, O., Lampert, R.: Rigorous approximated determinization of weighted automata. Theor. Comput. Sci. 480, 104\u2013117 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR8","unstructured":"Babari, P.: Quantitative Automata and Logic for Pictures and Data Words. Ph.D. thesis, Leipzig University (2017)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02658-4_14","volume-title":"Computer Aided Verification","author":"R Bloem","year":"2009","unstructured":"Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 140\u2013156. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_14"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Boker, U., Chatterjee, K., Henzinger, T.A., Kupferman, O.: Temporal specifications with accumulative values. ACM Trans. Comput. Log. 15(4), 27:1\u201327:25 (2014)","DOI":"10.1145\/2629686"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Boker, U., Henzinger, T.A.: Exact and approximate determinization of discounted-sum automata. Log. Methods Comput. Sci. 10(1), 1\u201333 (2014)","DOI":"10.2168\/LMCS-10(1:10)2014"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Boker, U.: Why these automata types? In: Proceedings of the LPAR, pp. 143\u2013163 (2018)","DOI":"10.29007\/c3bj"},{"key":"1_CR13","unstructured":"Boker, U., Hefetz, G.: Discounted-sum automata with multiple discount factors. In: Proceedings of the CSL. LIPIcs, vol. 183, pp. 12:1\u201312:23 (2021)"},{"key":"1_CR14","unstructured":"Boker, U., Henzinger, T.A.: Approximate determinization of quantitative automata. In: Proceedings of the FSTTCS. LIPIcs, vol. 18, pp. 362\u2013373 (2012)"},{"key":"1_CR15","unstructured":"Boker, U., Lehtinen, K.: Good for games automata: from nondeterminism to alternation. In: Fokkink, W.J., van Glabbeek, R. (eds.) Proceedings of the CONCUR. LIPIcs, vol. 140, pp. 19:1\u201319:16 (2019)"},{"key":"1_CR16","unstructured":"Boker, U., Lehtinen, K.: History determinism vs. good for gameness in quantitative automata. In: Proceedings of FSTTCS. pp. 35:1\u201335:20 (2021)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Markey, N., Matteplackel, R.: Averaging in LTL. In: Proceedings of the CONCUR, pp. 266\u2013280 (2014)","DOI":"10.1007\/978-3-662-44584-6_19"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-30000-9_1","volume-title":"Language and Automata Theory and Applications","author":"R Brenguier","year":"2016","unstructured":"Brenguier, R., et al.: Non-zero sum games for reactive synthesis. In: Dediu, A.-H., Janou\u0161ek, J., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 3\u201323. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30000-9_1"},{"key":"1_CR19","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Proceedings of the International Congress on Logic, Method, and Philosophy of Science. 1960, pp. 1\u201312. Stanford University Press (1962)"},{"issue":"4","key":"1_CR20","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s00453-001-0026-6","volume":"30","author":"AL Buchsbaum","year":"2001","unstructured":"Buchsbaum, A.L., Giancarlo, R., Westbrook, J.: An approximate determinization algorithm for weighted finite-state automata. Algorithmica 30(4), 503\u2013526 (2001)","journal-title":"Algorithmica"},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"AK Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114\u2013133 (1981)","journal-title":"J. ACM"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Stockmeyer, L.J.: Alternation. In: Proceedings of FOCS, pp. 98\u2013108 (1976)","DOI":"10.1109\/SFCS.1976.4"},{"key":"1_CR23","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). https:\/\/doi.org\/10.1007\/978-3-540-87531-4_28"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Alternating weighted automata. In: Proceedings of FCT, pp. 3\u201313 (2009)","DOI":"10.1007\/978-3-642-03409-1_2"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. ACM Trans. Comput. Log. 11(4), 23:1\u201323:38 (2010)","DOI":"10.1145\/1805950.1805953"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-19835-9_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Chatterjee","year":"2011","unstructured":"Chatterjee, K., Henzinger, T.A., Jobstmann, B., Singh, R.: QUASY: quantitative synthesis tool. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 267\u2013271. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19835-9_24"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Otop, J.: Nested weighted automata. ACM Trans. Comput. Log. 18(4), 31:1\u201331:44 (2017)","DOI":"10.1145\/3152769"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Colcombet, T.: The theory of stabilisation monoids and regular cost functions, pp. 139\u2013150 (2009)","DOI":"10.1007\/978-3-642-02930-1_12"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-17127-8_1","volume-title":"Foundations of Software Science and Computation Structures","author":"T Colcombet","year":"2019","unstructured":"Colcombet, T., Fijalkow, N.: Universal graphs and good for games automata: new tools for infinite duration games. In: Boja\u0144czyk, M., Simpson, A. (eds.) FoSSaCS 2019. LNCS, vol. 11425, pp. 1\u201326. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17127-8_1"},{"issue":"4","key":"1_CR30","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1137\/S0097539791224893","volume":"23","author":"K Culik","year":"1994","unstructured":"Culik, K., Karhumaki, J.: Finite automata computing real functions. SIAM J. Comput. 23(4), 789\u2013814 (1994)","journal-title":"SIAM J. Comput."},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-48523-6_25","volume-title":"Automata, Languages and Programming","author":"M Dickh\u00f6fer","year":"1999","unstructured":"Dickh\u00f6fer, M., Wilke, T.: Timed alternating tree automata: the automata-theoretic solution to the TCTL model checking problem. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 281\u2013290. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_25"},{"key":"1_CR32","unstructured":"Diekert, V., Gastin, P.: First-order definable languages. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Texts in Logic and Games, vol. 2, pp. 261\u2013306. Amsterdam University Press (2008)"},{"key":"1_CR33","unstructured":"Doyen, L.: Games and automata: From Boolean to quantitative verification. Habilitation Thesis, \u00c9cole Normale Sup\u00e9rieure de Cachan (2011)"},{"issue":"1\u20132","key":"1_CR34","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. Theor. Comput. Sci. 380(1\u20132), 69\u201386 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR35","unstructured":"Droste, M., Gastin, P.: Aperiodic weighted automata and weighted first-order logic. In: Proceedings of the MFCS. LIPIcs, vol. 138, pp. 76:1\u201376:15 (2019)"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-45061-0_35","volume-title":"Automata, Languages and Programming","author":"M Droste","year":"2003","unstructured":"Droste, M., Kuske, D.: Skew and infinitary formal power series. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 426\u2013438. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_35"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Droste, M., Meinecke, I.: Describing average- and longtime-behavior by weighted MSO logics. In: Proceedings of the MFCS, pp. 537\u2013548 (2010)","DOI":"10.1007\/978-3-642-15155-2_47"},{"key":"1_CR38","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":"1_CR39","doi-asserted-by":"crossref","unstructured":"Droste, M., Perevoshchikov, V.: Multi-weighted automata and MSO logic. In: Computer Science - Theory and Applications, pp. 418\u2013430 (2013)","DOI":"10.1007\/978-3-642-38536-0_36"},{"key":"1_CR40","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). https:\/\/doi.org\/10.1007\/11779148_6"},{"key":"1_CR41","volume-title":"Automata, Languages, and Machines","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Academic Press Inc., USA (1974)"},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"C Elgot","year":"1961","unstructured":"Elgot, C.: Decision problems of finite-automata design and related arithmetics. Trans. Am. Math. Soc. 98, 21\u201351 (1961)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"1_CR43","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.entcs.2008.11.019","volume":"220","author":"M Faella","year":"2008","unstructured":"Faella, M., Legay, A., Stoelinga, M.: Model checking quantitative linear time logic. Electron. Notes Theor. Comput. Sci. 220(3), 61\u201377 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Filiot, E., Gentilini, R., Raskin, J.: Quantitative languages defined by functional automata. Log. Methods Comput. Sci. 11(3), 1\u201332 (2015)","DOI":"10.2168\/LMCS-11(3:14)2015"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Filiot, E., Jecker, I., Lhote, N., P\u00e9rez, G.A., Raskin, J.: On delay and regret determinization of max-plus automata. In: LICS, pp. 1\u201312 (2017)","DOI":"10.1109\/LICS.2017.8005096"},{"key":"1_CR46","unstructured":"Filiot, E., L\u00f6ding, C., Winter, S.: Synthesis from weighted specifications with partial domains over finite words. In: Saxena, N., Simon, S. (eds.) FSTTCS. LIPIcs, vol. 182, pp. 46:1\u201346:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"1_CR47","doi-asserted-by":"crossref","unstructured":"Gabbay, D.M., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: Proceedings of the POPL, pp. 163\u2013173 (1980)","DOI":"10.1145\/567446.567462"},{"issue":"4","key":"1_CR48","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1007\/s00500-015-1952-6","volume":"22","author":"P Gastin","year":"2018","unstructured":"Gastin, P., Monmege, B.: A unifying survey on weighted logics and weighted automata - core weighted logic: minimal and versatile specification of quantitative properties. Soft. Comput. 22(4), 1047\u20131065 (2018)","journal-title":"Soft. Comput."},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-319-20028-6_21","volume-title":"Evolving Computability","author":"V Halava","year":"2015","unstructured":"Halava, V., Harju, T., Niskanen, R., Potapov, I.: Weighted automata on infinite words in the context of attacker-defender games. In: Beckmann, A., Mitrana, V., Soskova, M. (eds.) CiE 2015. LNCS, vol. 9136, pp. 206\u2013215. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20028-6_21"},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"Henzinger, T., Piterman, N.: Solving games without determinization, pp. 395\u2013410 (2006)","DOI":"10.1007\/11874683_26"},{"issue":"1","key":"1_CR51","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00236-016-0268-z","volume":"54","author":"P Hunter","year":"2016","unstructured":"Hunter, P., P\u00e9rez, G.A., Raskin, J.-F.: Reactive synthesis without regret. Acta Inform. 54(1), 3\u201339 (2016). https:\/\/doi.org\/10.1007\/s00236-016-0268-z","journal-title":"Acta Inform."},{"key":"1_CR52","unstructured":"Kamp, J.: Tense Logic and the Theory of Order. Ph.D. thesis, UCLA (1968)"},{"key":"1_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2018.05.003","volume":"740","author":"P Kostol\u00e1nyi","year":"2018","unstructured":"Kostol\u00e1nyi, P., Mis\u00fan, F.: Alternating weighted automata over commutative semirings. Theor. Comput. Sci. 740, 1\u201327 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR54","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-319-10575-8_4","volume-title":"Handbook of Model Checking","author":"O Kupferman","year":"2018","unstructured":"Kupferman, O.: Automata theory and model checking. In: Handbook of Model Checking, pp. 107\u2013151. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_4"},{"issue":"1","key":"1_CR55","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0213010","volume":"13","author":"R Ladner","year":"1984","unstructured":"Ladner, R., Lipton, R., Stockmeyer, L.: Alternating pushdown and stack automata. SIAM J. Comput. 13(1), 135\u2013155 (1984)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1_CR56","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0019-9958(77)90443-0","volume":"33","author":"RE Ladner","year":"1977","unstructured":"Ladner, R.E.: Application of model theoretic games to discrete linear orders and finite automata. Inf. Control 33(4), 281\u2013303 (1977)","journal-title":"Inf. Control"},{"key":"1_CR57","unstructured":"Lindsay, P.A.: On alternating $$\\omega $$-automata. Theoret. Comput. Sci. 43, 107\u2013116 (1988)"},{"key":"1_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/3-540-44929-9_36","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"C Loding","year":"2000","unstructured":"Loding, C., Thomas, W.: Alternating automata and logics over infinite words. In: van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P.D., Ito, T. (eds.) TCS 2000. LNCS, vol. 1872, pp. 521\u2013535. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44929-9_36"},{"key":"1_CR59","doi-asserted-by":"crossref","unstructured":"M. Droste, W.K., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer Publishing Company, Incorporated, Heidelberg (2009)","DOI":"10.1007\/978-3-642-01492-5"},{"key":"1_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-31606-7_32","volume-title":"Implementation and Application of Automata","author":"E Mandrali","year":"2012","unstructured":"Mandrali, E.: Weighted LTL with discounting. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 353\u2013360. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31606-7_32"},{"key":"1_CR61","unstructured":"McNaughton, R., Papert, S.: Counter-free Automata. M.I.T Press, Cambridge (1971)"},{"key":"1_CR62","unstructured":"Muller, D., Schupp, P.: Alternating automata on infinite trees. In: Automata on Infinite Words. LNCS, vol. 192, pp. 100\u2013107 (1985)"},{"issue":"3","key":"1_CR63","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0022-0000(86)90037-1","volume":"32","author":"D Perrin","year":"1986","unstructured":"Perrin, D., Pin, J.: First-order logic and star-free sets. J. Comput. Syst. Sci. 32(3), 393\u2013406 (1986)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"1_CR64","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"MO Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Inf. Control 6(3), 230\u2013245 (1963)","journal-title":"Inf. Control"},{"issue":"2","key":"1_CR65","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959)","journal-title":"IBM J. Res. Dev."},{"key":"1_CR66","doi-asserted-by":"crossref","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science, Springer, Heidelberg (1978)","DOI":"10.1007\/978-1-4612-6264-0"},{"issue":"2","key":"1_CR67","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"MP Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Inf. Control 4(2), 245\u2013270 (1961)","journal-title":"Inf. Control"},{"issue":"2","key":"1_CR68","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"MP Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8(2), 190\u2013194 (1965)","journal-title":"Inf. Control"},{"issue":"2","key":"1_CR69","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/S0019-9958(79)90629-6","volume":"42","author":"W Thomas","year":"1979","unstructured":"Thomas, W.: Star-free regular sets of omega-sequences. Inf. Control 42(2), 148\u2013156 (1979)","journal-title":"Inf. Control"},{"issue":"3","key":"1_CR70","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0019-9958(81)90663-X","volume":"48","author":"W Thomas","year":"1981","unstructured":"Thomas, W.: A combinatorial approach to the theory of omega-automata. Inf. Control 48(3), 261\u2013283 (1981)","journal-title":"Inf. Control"},{"key":"1_CR71","unstructured":"Trakhtenbrot, B.A.: Finite automata and logic of monadic predicates. Doklady Akademii Nauk SSSR (1961). In Russian"},{"key":"1_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/BFb0015261","volume-title":"Computer Science Today","author":"MY Vardi","year":"1995","unstructured":"Vardi, M.Y.: Alternating automata and program verification. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 471\u2013485. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0015261"},{"key":"1_CR73","unstructured":"Vardi, M.: Verification of concurrent programs: the automata-theoretic framework, pp. 167\u2013176 (1987)"},{"issue":"2","key":"1_CR74","doi-asserted-by":"publisher","first-page":"359","DOI":"10.36045\/bbms\/1102714178","volume":"8","author":"T Wilke","year":"2001","unstructured":"Wilke, T.: Alternating tree automata, parity games, and modal $$\\mu $$-calculus. Bull. Belgian Math. Soc. Simon Stevin 8(2), 359 (2001)","journal-title":"Bull. Belgian Math. Soc. Simon Stevin"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89716-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T19:09:16Z","timestamp":1725995356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89716-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030897154","9783030897161"],"references-count":74,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89716-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Liverpool","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp2021.csc.liv.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}