  In this paper we consider state reachability in networks composed of many
identical processes running a parametric timed broadcast protocol (PTBP). PTBP
are a new model extending both broadcast protocols and parametric timed
automata. This work is, up to our knowledge, the first to consider the
combination of both a parametric network size and timing parameters in clock
guard constraints. Since the communication topology is of utmost importance in
broadcast protocols, we investigate reachability problems in both clique
semantics where every message reaches every processes, and in reconfigurable
semantics where the set of receivers is chosen non-deterministically. In
addition, we investigate the decidability status depending on whether the
timing parameters in guards appear only as upper bounds in guards, as lower
bounds or when the set of parameters is partitioned in lower-bound and
upper-bound parameters.
