Skip to Main content Skip to Navigation
Conference papers

Reconfiguration and message losses in parameterized broadcast networks

Abstract : Broadcast networks allow one to model networks of identical nodes communicating through message broadcasts. Their parameterized verification aims at proving a property holds for any number of nodes, under any communication topology, and on all possible executions. We focus on the coverability problem which dually asks whether there exists an execution that visits a configuration exhibiting some given state of the broadcast protocol. Coverability is known to be undecidable for static networks, i.e. when the number of nodes and communication topology is fixed along executions. In contrast, it is decidable in PTIME when the communication topology may change arbitrarily along executions, that is for reconfigurable networks. Surprisingly, no lower nor upper bounds on the minimal number of nodes, or the minimal length of covering execution in reconfigurable networks, appear in the literature. In this paper we show tight bounds for cutoff and length, which happen to be linear and quadratic, respectively, in the number of states of the protocol. We also introduce an intermediary model with static communication topology and non-deterministic message losses upon sending. We show that the same tight bounds apply to lossy networks, although, reconfigurable executions may be linearly more succinct than lossy executions. Finally, we show NP-completeness for the natural optimisation problem associated with the cutoff.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-02191382
Contributor : Nathalie Bertrand <>
Submitted on : Tuesday, July 23, 2019 - 2:37:24 PM
Last modification on : Tuesday, March 30, 2021 - 12:12:07 PM

File

concur.pdf
Files produced by the author(s)

Identifiers

Citation

Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar. Reconfiguration and message losses in parameterized broadcast networks. CONCUR 2019 - 30th International Conference on Concurrency Theory, Aug 2019, Amsterdam, Netherlands. pp.1 - 15, ⟨10.4230/LIPIcs.CONCUR.2019.32⟩. ⟨hal-02191382⟩

Share

Metrics

Record views

48

Files downloads

816