Parameterized verification of synchronization in constrained reconfigurable broadcast networks

Abstract : Reconfigurable broadcast networks provide a convenient formalism for modelling and reasoning about networks of mobile agents broadcasting messages to other agents following some (evolving) communication topology. The parameterized verification of such models aims at checking whether a given property holds irrespective of the initial configuration (number of agents, initial states and initial communication topology). We focus here on the synchronization property, asking whether all agents converge to a set of target states after some execution. This problem is known to be decidable in polynomial time when no constraints are imposed on the evolution of the communication topology (while it is undecidable for static broadcast networks). In this paper we investigate how various constraints on reconfigurations affect the decidability and complexity of the synchronization problem. In particular, we show that when bounding the number of reconfigured links between two communications steps by a constant, synchronization becomes undecidable; on the other hand, synchronization remains decidable in PTIME when the bound grows with the number of agents.
Complete list of metadatas
Contributor : Nicolas Markey <>
Submitted on : Friday, October 5, 2018 - 3:49:23 PM
Last modification on : Thursday, February 7, 2019 - 4:54:10 PM
Long-term archiving on : Sunday, January 6, 2019 - 4:17:43 PM


Files produced by the author(s)



A.R. Balasubramanian, Nathalie Bertrand, Nicolas Markey. Parameterized verification of synchronization in constrained reconfigurable broadcast networks. TACAS 2018 - International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Apr 2018, Thessaloniki, Greece. pp.38-54, ⟨10.1007/978-3-319-89963-3_3⟩. ⟨hal-01889046⟩



Record views


Files downloads