3 citations · 3 across the 2 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2014
Abelian networks II. Halting on all inputs
Benjamin Bond, Lionel Levine
Abelian networks are systems of communicating automata satisfying a local commutativity condition. We show that a finite irreducible abelian network halts on all inputs if and only…
cs.FL2013
Abelian networks I. Foundations and examples
Benjamin Bond, Lionel Levine
In Deepak Dhar's model of abelian distributed processors, automata occupy the vertices of a graph and communicate via the edges. We show that two simple axioms ensure that the fina…