Udi Boker

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 45

Top Topics

Finite Automata

Regular Languages

Top Venues

Log. Methods Comput. Sci.

Publications

Udi Boker
Discounted-Sum Automata with Real-Valued Discount Factors. LICS (2024)
Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, Aditya Prakash
History-Determinism vs Fair Simulation. CONCUR (2024)
Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, Aditya Prakash
History-Determinism vs Fair Simulation. CoRR (2024)
Udi Boker, Karoliina Lehtinen
When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism. ACM SIGLOG News 10 (1) (2023)
Udi Boker, Guy Hefetz
Discounted-Sum Automata with Multiple Discount Factors. CoRR (2023)
Udi Boker, Karoliina Lehtinen
Token Games and History-Deterministic Quantitative-Automata. Log. Methods Comput. Sci. 19 (4) (2023)
Shaull Almagor, Daniel Assa, Udi Boker
Synchronized CTL over One-Counter Automata. CoRR (2023)
Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç
Safety and Liveness of Quantitative Automata. CoRR (2023)
Udi Boker, Guy Hefetz
On the Comparison of Discounted-Sum Automata with Multiple Discount Factors. FoSSaCS (2023)
Shaull Almagor, Daniel Assa, Udi Boker
Synchronized CTL over One-Counter Automata. FSTTCS (2023)
Udi Boker, Guy Hefetz
On the Comparison of Discounted-Sum Automata with Multiple Discount Factors. CoRR (2023)
Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç
Safety and Liveness of Quantitative Automata. CONCUR (2023)
Udi Boker, Karoliina Lehtinen
Token Games and History-Deterministic Quantitative Automata. FoSSaCS (2022)
Shaull Almagor, Udi Boker, Orna Kupferman
What's decidable about weighted automata? Inf. Comput. 282 (2022)
Udi Boker, Karoliina Lehtinen, Salomon Sickert
On the Translation of Automata to Linear Temporal Logic. FoSSaCS (2022)
Udi Boker, Karoliina Lehtinen, Salomon Sickert
On the Translation of Automata to Linear Temporal Logic. CoRR (2022)
Ori Lahav, Udi Boker
What's Decidable About Causally Consistent Shared Memory? ACM Trans. Program. Lang. Syst. 44 (2) (2022)
Udi Boker
Between Deterministic and Nondeterministic Quantitative Automata (Invited Talk). CSL (2022)
Udi Boker, Karoliina Lehtinen
History Determinism vs. Good for Gameness in Quantitative Automata. FSTTCS (2021)
Udi Boker, Karoliina Lehtinen
History Determinism vs. Good for Gameness in Quantitative Automata. CoRR (2021)
Udi Boker, Karoliina Lehtinen
Token Games and History-Deterministic Quantitative-Automata. CoRR (2021)
Udi Boker, Guy Hefetz
Discounted-Sum Automata with Multiple Discount Factors. CSL (2021)
Udi Boker
Quantitative vs. Weighted Automata. RP (2021)
Ori Lahav, Udi Boker
Decidable verification under a causally consistent shared memory. PLDI (2020)
Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke
Parametrized Universality Problems for One-Counter Nets. CoRR (2020)
Karoliina Lehtinen, Udi Boker
Register Games. Log. Methods Comput. Sci. 16 (2) (2020)
Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
On the Succinctness of Alternating Parity Good-for-Games Automata. CoRR (2020)
Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
On Succinctness and Recognisability of Alternating Good-for-Games Automata. CoRR (2020)
Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
On the Succinctness of Alternating Parity Good-For-Games Automata. FSTTCS (2020)
Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke
Parametrized Universality Problems for One-Counter Nets. CONCUR (2020)
Udi Boker, Karoliina Lehtinen
Register Games. CoRR (2019)
Udi Boker
Inherent Size Blowup in ω-Automata. DLT (2019)
Udi Boker, Karoliina Lehtinen
Good for Games Automata: From Nondeterminism to Alternation. CONCUR (2019)
Udi Boker, Karoliina Lehtinen
Good for Games Automata: From Nondeterminism to Alternation. CoRR (2019)
Udi Boker, Yariv Shaulian
Automaton-Based Criteria for Membership in CTL. LICS (2018)
Dana Angluin, Udi Boker, Dana Fisman
Families of DFAs as Acceptors of ω-Regular Languages. Log. Methods Comput. Sci. 14 (1) (2018)
Udi Boker, Karoliina Lehtinen
On the Way to Alternating Weak Automata. FSTTCS (2018)
Udi Boker
Why These Automata Types? LPAR (2018)
Udi Boker
On the (In)Succinctness of Muller Automata. CSL (2017)
Udi Boker, Orna Kupferman, Michal Skrzypczak
How Deterministic are Good-For-Games Automata? CoRR (2017)
Udi Boker, Orna Kupferman, Michal Skrzypczak
How Deterministic are Good-For-Games Automata?. FSTTCS (2017)
Udi Boker
Rabin vs. Streett Automata. FSTTCS (2017)
Dana Angluin, Udi Boker, Dana Fisman
Families of DFAs as Acceptors of $ω$-Regular Languages. CoRR (2016)
Shaull Almagor, Udi Boker, Orna Kupferman
Formally Reasoning About Quality. J. ACM 63 (3) (2016)
Dana Angluin, Udi Boker, Dana Fisman
Families of DFAs as Acceptors of omega-Regular Languages. MFCS (2016)
Udi Boker, Thomas A. Henzinger, Jan Otop
The Target Discounted-Sum Problem. LICS (2015)
Shaull Almagor, Udi Boker, Orna Kupferman
Discounting in LTL. CoRR (2014)
Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman
Temporal Specifications with Accumulative Values. ACM Trans. Comput. Log. 15 (4) (2014)
Udi Boker, Thomas A. Henzinger, Arjun Radhakrishna
Battery transition systems. POPL (2014)
Udi Boker, Thomas A. Henzinger
Exact and Approximate Determinization of Discounted-Sum Automata. Log. Methods Comput. Sci. 10 (1) (2014)
Shaull Almagor, Udi Boker, Orna Kupferman
Discounting in LTL. TACAS (2014)
Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak
Nondeterminism in the Presence of a Diverse or Unknown Future. ICALP (2) (2013)
Shaull Almagor, Udi Boker, Orna Kupferman
Formalizing and Reasoning about Quality. ICALP (2) (2013)
Udi Boker, Thomas A. Henzinger
Approximate Determinization of Quantitative Automata. FSTTCS (2012)
Udi Boker, Orna Kupferman
Translating to Co-Büchi Made Tight, Unified, and Useful. ACM Trans. Comput. Log. 13 (4) (2012)
Shaull Almagor, Udi Boker, Orna Kupferman
What's Decidable about Weighted Automata? ATVA (2011)
Udi Boker, Thomas A. Henzinger
Determinizing Discounted-Sum Automata. CSL (2011)
Udi Boker, Orna Kupferman
Co-Büching Them All. FoSSaCS (2011)
Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman
Temporal Specifications with Accumulative Values. LICS (2011)
Udi Boker, Nachum Dershowitz
Three Paths to Effectiveness. Fields of Logic and Computation (2010)
Udi Boker, Orna Kupferman
The Quest for a Tight Translation of Büchi to co-Büchi Automata. Fields of Logic and Computation (2010)
Udi Boker, Orna Kupferman, Adin Rosenberg
Alternation Removal in Büchi Automata. ICALP (2) (2010)
Udi Boker, Orna Kupferman, Avital Steinitz
Parityizing Rabin and Streett. FSTTCS (2010)
Udi Boker, Nachum Dershowitz
The influence of domain interpretations on computational models. Appl. Math. Comput. 215 (4) (2009)
Udi Boker, Orna Kupferman
Co-ing Büchi Made Tight and Useful. LICS (2009)
Udi Boker, Nachum Dershowitz
The Church-Turing Thesis over Arbitrary Domains. Pillars of Computer Science (2008)
Udi Boker, Nachum Dershowitz
A hypercomputational alien. Appl. Math. Comput. 178 (1) (2006)
Udi Boker, Nachum Dershowitz
Comparing Computational Power. Log. J. IGPL 14 (5) (2006)
Udi Boker, Nachum Dershowitz
Abstract Effective Models. Electron. Notes Theor. Comput. Sci. 135 (3) (2006)
Udi Boker, Nachum Dershowitz
How to Compare the Power of Computational Models. CiE (2005)
Udi Boker, Nachum Dershowitz
Comparing Computational Power CoRR (2005)