On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks

Giorgio Delzanno (1) , Arnaud Sangnier (2) , Riccardo Traverso (1) , Gianluigi Zavattaro (3, 4)

1 DIBRIS - Dipartimento di Informatica, Bioingegneria, Robotica e Ingegneria dei Sistemi [Genova]
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
3 DISI - Dipartimento di Scienze dell'Informazione [Bologna]
4 FOCUS - Foundations of Component-based Ubiquitous Systems

We investigate the impact of dynamic topology reconfiguration on the complexity of verification problems for models of protocols with broadcast communication. We first consider reachability of a configuration with a given set of control states and show that parameterized verification is decidable with polynomial time complexity. We then move to richer queries and show how the complexity changes when considering properties with negation or cardinality constraints.

Mots clés: Broadcast Communication; Parameterized Verification; Algorithms and Complexity

Domaines: Logique en informatique [cs.LO]

Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso, Gianluigi Zavattaro. On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. 2012. ⟨hal-00740518⟩