Distributed local strategies in broadcast networks

Abstract : We study the problems of reaching a specific control state, or converging to a set of target states, in networks with a parameterized number of identical processes communicating via broadcast. To reflect the distributed aspect of such networks, we restrict our attention to executions in which all the processes must follow the same local strategy that, given their past performed actions and received messages, provides the next action to be performed. We show that the reachability and target problem under such local strategies are NP-complete, assuming that the set of receivers is chosen non-deterministically at each step. On the other hand, these problems become undecidable when the communication topology is a clique. However, decidability can be regained with the additional assumption that all processes are bound to receive the broadcast messages.
Type de document :
Communication dans un congrès
26th International Conference on Concurrency Theory (CONCUR 2015), Sep 2015, Madrid, Spain. 〈10.4230/LIPIcs.CONCUR.2015.44〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01243595
Contributeur : Nathalie Bertrand <>
Soumis le : mardi 15 décembre 2015 - 11:02:39
Dernière modification le : mercredi 16 mai 2018 - 11:24:07

Identifiants

Citation

Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier. Distributed local strategies in broadcast networks. 26th International Conference on Concurrency Theory (CONCUR 2015), Sep 2015, Madrid, Spain. 〈10.4230/LIPIcs.CONCUR.2015.44〉. 〈hal-01243595〉

Partager

Métriques

Consultations de la notice

210