2 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.DC2024
Coefficient Synthesis for Threshold Automata
A. R. Balasubramanian
Threshold automata are a formalism for modeling fault-tolerant distributed algorithms. The main feature of threshold automata is the notion of a threshold guard, which allows us to…