{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T09:06:39Z","timestamp":1784797599115,"version":"3.55.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032325259","type":"print"},{"value":"9783032325266","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T00:00:00Z","timestamp":1784851200000},"content-version":"vor","delay-in-days":204,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"abstract":"Abstract<\/jats:title>\n \n Emerson-Lei automata, which allow arbitrary Boolean combinations of\n \n \n $$\\texttt{Fin}$$<\/jats:tex-math>\n \n Fin<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n and\n \n \n $$\\texttt{Inf}$$<\/jats:tex-math>\n \n Inf<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n acceptance conditions, provide a unifying framework for\n \n \n $$\\omega $$<\/jats:tex-math>\n \n \u03c9<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n -automata but pose significant challenges for determinization. The previous best algorithm relies on a transformation that introduces an exponential blow-up in the state space before determinization even begins.\n <\/jats:p>\n \n We present a new determinization algorithm that completely bypasses this bottleneck. Our key insight is that each disjunct of an Emerson-Lei condition in DNF corresponds directly to a\n one-Fin automaton<\/jats:italic>\n \u2014a restricted form of Streett automaton whose structure enables more efficient determinization via H-Safra trees. By exploiting this connection, we establish an upper bound of\n \n \n $$ 2^{O\\!\\big (3^{|\\alpha |\/3} \\cdot (n \\log n + n|\\alpha | \\log |\\alpha |)\\big )} $$<\/jats:tex-math>\n \n \n 2<\/mml:mn>\n \n O<\/mml:mi>\n \n \n (<\/mml:mo>\n <\/mml:mrow>\n \n 3<\/mml:mn>\n \n |<\/mml:mo>\n \u03b1<\/mml:mi>\n |<\/mml:mo>\n \/<\/mml:mo>\n 3<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msup>\n \u00b7<\/mml:mo>\n \n (<\/mml:mo>\n n<\/mml:mi>\n log<\/mml:mo>\n n<\/mml:mi>\n +<\/mml:mo>\n n<\/mml:mi>\n |<\/mml:mo>\n \u03b1<\/mml:mi>\n |<\/mml:mo>\n log<\/mml:mo>\n |<\/mml:mo>\n \u03b1<\/mml:mi>\n |<\/mml:mo>\n )<\/mml:mo>\n <\/mml:mrow>\n \n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:disp-formula>\n where\n n<\/jats:italic>\n is the number of states and\n \n \n $$|\\alpha |$$<\/jats:tex-math>\n \n \n |<\/mml:mo>\n \u03b1<\/mml:mi>\n |<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n is the acceptance condition size. This improves the exponent over the previous best bound by a factor of\n \n \n $$2^{2|\\alpha |}\/3^{|\\alpha |\/3}$$<\/jats:tex-math>\n \n \n \n 2<\/mml:mn>\n \n 2<\/mml:mn>\n |<\/mml:mo>\n \u03b1<\/mml:mi>\n |<\/mml:mo>\n <\/mml:mrow>\n <\/mml:msup>\n \/<\/mml:mo>\n \n 3<\/mml:mn>\n \n |<\/mml:mo>\n \u03b1<\/mml:mi>\n |<\/mml:mo>\n \/<\/mml:mo>\n 3<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msup>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , an exponential improvement in the acceptance condition complexity.\n <\/jats:p>","DOI":"10.1007\/978-3-032-32526-6_14","type":"book-chapter","created":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T08:47:24Z","timestamp":1784796444000},"page":"284-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Upper Bound for\u00a0the\u00a0Determinization of\u00a0Emerson-Lei Automata: A One-Fin Approach"],"prefix":"10.1007","author":[{"given":"Runzhe","family":"Ma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cong","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wensheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenhua","family":"Duan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,24]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-319-21690-4_31","volume-title":"Computer Aided Verification","author":"T Babiak","year":"2015","unstructured":"Babiak, T., et al.: The Hanoi omega-automata format. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 479\u2013486. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_31"},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10009-019-00508-4","volume":"21","author":"V Bloemen","year":"2019","unstructured":"Bloemen, V., Duret-Lutz, A., van de Pol, J.: Model checking with generalized Rabin and Fin-less automata. Int. J. Softw. Tools Technol. Transfer 21(3), 307\u2013324 (2019). https:\/\/doi.org\/10.1007\/s10009-019-00508-4","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"B\u00fcchi, J.R.: On a Decision Method in Restricted Second Order Arithmetic, pp. 1\u201311. Stanford University Press, Berkeley (1960\/1962). https:\/\/doi.org\/10.1007\/978-1-4613-8928-6_23","DOI":"10.1007\/978-1-4613-8928-6_23"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Cai, Y., Zhang, T.: Tight upper bounds for Streett and parity complementation. In: Proceedings of the 20th EACSL Annual Conference on Computer Science Logic (CSL), pp. 112\u2013128 (2011). https:\/\/doi.org\/10.48550\/arXiv.1102.2960","DOI":"10.48550\/arXiv.1102.2960"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Duret-Lutz, A., Lewkowicz, A., Fauchille, A., Michaud, T., Renault, E., Xu, L.: Spot 2.0 \u2014 a framework for LTL and $$\\omega $$-automata manipulation. In: ATVA 2016, pp. 122\u2013129 (2016). https:\/\/doi.org\/10.1007\/978-3-319-46520-3_8","DOI":"10.1007\/978-3-319-46520-3_8"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0167-6423(87)90036-0","volume":"8","author":"EA Emerson","year":"1987","unstructured":"Emerson, E.A., Lei, C.L.: Modalities for model checking: branching time logic strikes back. Sci. Comput. Program. 8(3), 275\u2013306 (1987). https:\/\/doi.org\/10.1016\/0167-6423(87)90036-0","journal-title":"Sci. Comput. Program."},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Fogarty, S., Vardi, M.Y.: B\u00fcchi complementation and size-change termination. ACM Trans. Comput. Logic 14(4), 29:1\u201329:33 (2013). https:\/\/doi.org\/10.2168\/lmcs-8(1:13)2012","DOI":"10.2168\/lmcs-8(1:13)2012"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Havlena, V., Leng\u00e1l, O., Li, Y., Strej\u010dek, B., Turrini, A.: Modular mix-and-match complementation of B\u00fcchi automata. In: Proceedings of the 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS, vol. 14571, pp. 249\u2013270. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-30823-9_13","DOI":"10.1007\/978-3-031-30823-9_13"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Havlena, V., Leng\u00e1l, O., \u0160mahl\u00edkov\u00e1, B.: Complementation of Emerson-Lei automata. In: Abdulla, P.A., Kesner, D. (eds.) Foundations of Software Science and Computation Structures (FoSSaCS 2025). LNCS, vol. 15691, pp. 88\u2013110. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-90897-2_5","DOI":"10.1007\/978-3-031-90897-2_5"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-030-88885-5_2","volume-title":"Automated Technology for Verification and Analysis","author":"T John","year":"2021","unstructured":"John, T., Jantsch, S., Baier, C., Kl\u00fcppelholz, S.: Determinization and limit-determinization of Emerson-Lei automata. In: Hou, Z., Ganesh, V. (eds.) ATVA 2021. LNCS, vol. 12971, pp. 15\u201331. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88885-5_2"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-030-01090-4_34","volume-title":"Automated Technology for Verification and Analysis","author":"J K\u0159et\u00ednsk\u00fd","year":"2018","unstructured":"K\u0159et\u00ednsk\u00fd, J., Meggendorfer, T., Sickert, S.: Owl: a library for $$\\omega $$-words, automata, and LTL. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 543\u2013550. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_34"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/istcs.1997.595167","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(3), 408\u2013429 (2001). https:\/\/doi.org\/10.1109\/istcs.1997.595167","journal-title":"ACM Trans. Comput. Log."},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"L\u00f6ding, C.: Optimal bounds for transformations of $$\\omega $$-automata. In: Proceedings of the 19th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 97\u2013109 (1999). https:\/\/doi.org\/10.1007\/3-540-46691-6_8","DOI":"10.1007\/3-540-46691-6_8"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.2168\/lmcs-3(3:5)2007","volume":"3","author":"N Piterman","year":"2006","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. Log. Methods Comput. Sci. 3(3), 5 (2006). https:\/\/doi.org\/10.2168\/lmcs-3(3:5)2007","journal-title":"Log. Methods Comput. Sci."},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-59152-6_7","volume-title":"Automated Technology for Verification and Analysis","author":"F Renkin","year":"2020","unstructured":"Renkin, F., Duret-Lutz, A., Pommellet, A.: Practical \u201cParitizing\u2019\u2019 of Emerson-Lei Automata. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 127\u2013143. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_7"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Safra, S.: On the complexity of omega-automata. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS), pp. 319\u2013327. IEEE Computer Society (1988). https:\/\/doi.org\/10.1109\/sfcs.1988.21948","DOI":"10.1109\/sfcs.1988.21948"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Safra, S.: Exponential determinization for $$\\omega $$-automata with strong-fairness acceptance condition. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC), pp. 275\u2013282. ACM Press (1992). https:\/\/doi.org\/10.1137\/s0097539798332518","DOI":"10.1137\/s0097539798332518"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-00596-1_13","volume-title":"Foundations of Software Science and Computational Structures","author":"S Schewe","year":"2009","unstructured":"Schewe, S.: Tighter bounds for the determinisation of B\u00fcchi automata. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 167\u2013181. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00596-1_13"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-33386-6_5","volume-title":"Automated Technology for Verification and Analysis","author":"S Schewe","year":"2012","unstructured":"Schewe, S., Varghese, T.: Tight bounds for the determinisation and complementation of generalised B\u00fcchi automata. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol. 7561, pp. 42\u201356. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33386-6_5"},{"issue":"1\u20132","key":"14_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/s0019-9958(82)91258-x","volume":"54","author":"RS Streett","year":"1982","unstructured":"Streett, R.S.: Propositional dynamic logic of looping and converse is elementarily decidable. Inf. Control 54(1\u20132), 121\u2013141 (1982). https:\/\/doi.org\/10.1016\/s0019-9958(82)91258-x","journal-title":"Inf. Control"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013191. Elsevier (1990). https:\/\/doi.org\/10.1016\/b978-0-444-88074-1.50009-3","DOI":"10.1016\/b978-0-444-88074-1.50009-3"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Tian, C., Wang, W., Duan, Z.: Making Streett determinization tight. In: Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201314. Saarbr\u00fccken, Germany (2020). https:\/\/doi.org\/10.1145\/3373718.3394757","DOI":"10.1145\/3373718.3394757"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Yan, Q.: Lower bounds for complementation of $$\\omega $$-automata via the full automata technique. In: Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), pp. 589\u2013600 (2008). https:\/\/doi.org\/10.1007\/11787006_50","DOI":"10.1007\/11787006_50"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Zhang, T., Cai, Y.: Can nondeterminism help complementation? In: Proceedings of the 3rd International Symposium on Games, Automata, Logics and Formal Verification (GandALF), pp. 57\u201370 (2012). https:\/\/doi.org\/10.4204\/eptcs.96.5","DOI":"10.4204\/eptcs.96.5"},{"issue":"1\u20132","key":"14_CR25","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/s0304-3975(98)00009-7","volume":"200","author":"W Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoret. Comput. Sci. 200(1\u20132), 135\u2013183 (1998). https:\/\/doi.org\/10.1016\/s0304-3975(98)00009-7","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-32526-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T08:47:26Z","timestamp":1784796446000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32526-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032325259","9783032325266"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32526-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"24 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.floc26.org\/program","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}