2 citations · 4 across the 10 of their papers we have counts for
3 papers · 1 filter
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
A. R. Balasubramanian, Javier Esparza, Mikhail Raskin
In rendez-vous protocols an arbitrarily large number of indistinguishable finite-state agents interact in pairs. The cut-off problem asks if there exists a number such that all…
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…
Characterizing consensus in the Heard-Of model
A. R. Balasubramanian, Igor Walukiewicz
The Heard-Of model is a simple and relatively expressive model of distributed computation. Because of this, it has gained a considerable attention of the verification community. We…