Distributed Consensus on Boolean Information

In this paper we study the convergence towards consensus on information in a distributed system of agents communicating over a network. The particularity of this study is that the information on which the consensus is seeked is not represented by real numbers, rather by logical values or sets. Whereas the problems of allowing a network of agents to reach a consensus on logical functions of input events, and that of agreeing on set–valued information, have been separately addressed in previous work, in this paper we show that these problems can indeed be attacked in a unified way in the framework of Boolean distributed information systems. Based on a notion of contractivity for Boolean dynamical systems, a necessary and sufficient condition ensuring the global convergence toward a unique equilibrium point is presented. This result can be seen as a first step toward the definition of a unified framework to uniformly address all consensus problems on Boolean algebras.