{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:57:37Z","timestamp":1743076657306,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031787089"},{"type":"electronic","value":"9783031787096"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-78709-6_1","type":"book-chapter","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:10:27Z","timestamp":1738361427000},"page":"3-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Playing Games on\u00a0Automata"],"prefix":"10.1007","author":[{"given":"Orna","family":"Kupferman","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abu Radi, B., Kupferman, O.: Minimization and canonization of GFG transition-based automata. Log. Meth. Comput. Sci. 18(3) (2022)","DOI":"10.46298\/lmcs-18(3:16)2022"},{"key":"1_CR2","unstructured":"Abu Radi, B., Kupferman, O., Leshkowitz, O.: A hierarchy of nondeterminism. In: 46th International Symposium on Mathematical Foundations of Computer Science. LIPIcs, vol. 202, pp. 85:1\u201385:21 (2021)"},{"key":"1_CR3","unstructured":"Abu Radi, B., Kupferman, O., Leshkowitz, O.: Easy complementation of history-deterministic b\u00fcchi automata. In: 22nd International Symposium on Automated Technology for Verification and Analysis. LNCS. Springer (2024)"},{"key":"1_CR4","unstructured":"Bagnol, M., Kuperberg, D.: B\u00fcchi good-for-games automata are efficiently recognizable. In: Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol. 122, pp. 16:1\u201316:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-39212-2_11","volume-title":"Automata, Languages, and Programming","author":"U Boker","year":"2013","unstructured":"Boker, U., Kuperberg, D., Kupferman, O., Skrzypczak, M.: Nondeterminism in the presence of a diverse or unknown future. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 89\u2013100. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_11"},{"key":"1_CR6","unstructured":"Boker, U., Kuperberg, D., Lehtinen, K., Skrzypczak, M.: On the succinctness of alternating parity good-for-games automata. In: Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol. 182, pp. 41:1\u201341:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/3584676.3584682","volume":"10","author":"U Boker","year":"2023","unstructured":"Boker, U., Lehtinen, K.: When a little nondeterminism goes a long way: an introduction to history-determinism. ACM SIGLOG News 10(1), 177\u2013196 (2023)","journal-title":"ACM SIGLOG News"},{"key":"1_CR8","unstructured":"Church, A.: Logic, arithmetics, and automata. In: 1962 Proceedings of the International Congress of Mathematicians, pp. 23\u201335. Institut Mittag-Leffler (1963)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-02930-1_12","volume-title":"Automata, Languages and Programming","author":"T Colcombet","year":"2009","unstructured":"Colcombet, T.: The theory of stabilisation monoids and regular cost functions. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 139\u2013150. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_12"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Faran, R., Kupferman, O.: On $$(I\/O)$$-aware good-for-games automata. In: 18th International Symposium on Automated Technology for Verification and Analysis. LNCS, vol. 12302, pp. 161\u2013178. Springer, Heidelberg (2020)","DOI":"10.1007\/978-3-030-59152-6_9"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-36387-4_2","volume-title":"Automata Logics, and Infinite Games","author":"R Mazala","year":"2002","unstructured":"Mazala, R.: Infinite games. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata Logics, and Infinite Games. LNCS, vol. 2500, pp. 23\u201338. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4_2"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/11874683_26","volume-title":"Computer Science Logic","author":"TA Henzinger","year":"2006","unstructured":"Henzinger, T.A., Piterman, N.: Solving games without determinization. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 395\u2013410. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11874683_26"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Kuperberg, D., Skrzypczak, M.: On determinisation of good-for-games automata. In: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, pp. 299\u2013310 (2015)","DOI":"10.1007\/978-3-662-47666-6_24"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"1114625","DOI":"10.3389\/fcomp.2022.1114625","volume":"4","author":"O Kupferman","year":"2022","unstructured":"Kupferman, O.: Using the past for resolving the future. Front. Comput. Sci. 4, 1114625 (2022)","journal-title":"Front. Comput. Sci."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Sadigh, D., Seshia, S.A.: Synthesis with clairvoyance. In: 7th International Haifa Verification Conference. LNCS, vol. 7261, pp. 5\u201319. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-34188-5_5"},{"issue":"1\u20133","key":"1_CR16","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.apal.2005.06.009","volume":"138","author":"O Kupferman","year":"2006","unstructured":"Kupferman, O., Safra, S., Vardi, M.Y.: Relating word and tree automata. Ann. Pure Appl. Logic 138(1\u20133), 126\u2013146 (2006)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1145\/377978.377993","volume":"2","author":"O Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Trans. Comput. Log. 2(2), 408\u2013429 (2001)","journal-title":"ACM Trans. Comput. Log."},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","volume":"13","author":"A Pnueli","year":"1981","unstructured":"Pnueli, A.: The temporal semantics of concurrent programs. Theoret. Comput. Sci. 13, 45\u201360 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proceedings of the 16th ACM Symposium on Principles of Programming Languages, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"key":"1_CR20","unstructured":"Schewe, S.: Minimising good-for-games automata is NP-complete. In: Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol. 182, pp. 56:1\u201356:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"AP Sistla","year":"1987","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for B\u00fcchi automata with applications to temporal logic. Theoret. Comput. Sci. 49, 217\u2013237 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-59042-0_57","volume-title":"STACS 95","author":"W Thomas","year":"1995","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1\u201313. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59042-0_57"},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"MY Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. J. Comput. Syst. Sci. 32(2), 182\u2013221 (1986)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"1_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"MY Vardi","year":"1994","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf. Comput. 115(1), 1\u201337 (1994)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78709-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:10:34Z","timestamp":1738361434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78709-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031787089","9783031787096"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78709-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}