3 papers
cs.LO2025
Complexity of Verification and Synthesis of Threshold Automata
A. R. Balasubramanian, Javier Esparza, Marijana Lazic
Threshold automata are a formalism for modeling and analyzing fault-tolerant distributed algorithms, recently introduced by Konnov, Veith, and Widder, describing protocols executed…
cs.DC2025
Regular Model Checking Upside-Down: An Invariant-Based Approach
Javier Esparza, Michael Raskin, Christoph Welzel-Mohr
Regular model checking is a technique for the verification of infinite-state systems whose configurations can be represented as finite words over a suitable alphabet. The form we a…
cs.FL2024
A Uniform Framework for Problems on Context-Free Grammars
Javier Esparza, Peter Rossmanith, Stefan Schwoon
In a paper published in Information Processing Letters in 2000, Bouajjani et al. presented an automata-based approach to a number of elementary problems on context-free grammars. T…