Adding Data Registers to Parameterized Networks with Broadcast

Abstract

We study parameterized verification problems for networks of interacting register automata. The network is represented through a graph, and processes may exchange broadcast messages containing data with their neighbours. Upon reception a process can either ignore a sent value, test for equality with a value stored in a register, or simply store the value in a register. We consider safety properties expressed in terms of reachability, from arbitrarily large initial configurations, of a configuration exposing some given control states and patterns. We investigate, in this context, the impact on decidability and complexity of the number of local registers, the number of values carried by a single message, and dynamic reconfigurations of the underlying network

The complexity of verifying population protocols

“…The IO and DO observation models of [7] are closely related to Reconfigurable Broadcast Networks (RBN), introduced by Delzanno et al in [27], and further studied in [11,26]. 4 − − → r for every state r .…”

“…So IO protocols are a special case of RBNs. However, the analysis problems we study are more general than the ones studied in [11,26,27]. The parameterized reachability problem studied in [27] corresponds to the problem whether a given counting set is reachable from a cube [L, U ] such that L(q) = 0 and U (q) ∈ {0, ∞} for every state q (i.e., from configurations that can put arbitrarily many agents in some states, and no agent in others).…”