2 citations · 4 across the 10 of their papers we have counts for
13 papers
Parameterized Verification of Coverability in Infinite State Broadcast Networks
A. R. Balasubramanian
Parameterized verification of coverability in broadcast networks with finite state processes has been studied for different types of models and topologies. In this paper, we attemp…
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…
Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version)
A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy
Reconfigurable broadcast networks (RBN) are a model of distributed computation in which agents can broadcast messages to other agents using some underlying communication topology w…
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent
A. R. Balasubramanian, Chana Weil-Kennedy
We show the equivalence of two distributed computing models, namely reconfigurable broadcast networks (RBN) and asynchronous shared-memory systems (ASMS), that were introduced inde…
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version)
A. R. Balasubramanian, Chana Weil-Kennedy
We show the equivalence of two distributed computing models, namely reconfigurable broadcast networks (RBN) and asynchronous shared-memory systems (ASMS), that were introduced inde…
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics
A. R. Balasubramanian, Timo Lang, Revantha Ramanayake
We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proo…
Adaptive Synchronisation of Pushdown Automata
A. R. Balasubramanian, K. S. Thejaswini
We introduce the notion of adaptive synchronisation for pushdown automata, in which there is an external observer who has no knowledge about the current state of the pushdown autom…
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…
Complexity of controlled bad sequences over finite sets of
A. R. Balasubramanian
We provide upper and lower bounds for the length of controlled bad sequences over the majoring and the minoring orderings of finite sets of . The results are obtained…
Parameterized Verification of Coverability in Well-Structured Broadcast Networks
A. R. Balasubramanian
Parameterized verification of coverability in broadcast networks with finite state processes has been studied for different types of models and topologies. In this paper, we attemp…
Parameterized verification of synchronization in constrained reconfigurable broadcast networks
A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey
Reconfigurable broadcast networks provide a convenient formalism for modelling and reasoning about networks of mobile agents broadcasting messages to other agents following some (e…