2 citations · 3 across the 3 of their papers we have counts for
8 papers
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…
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…