Blogs (1) >>
POPL 2019
Sun 13 - Sat 19 January 2019 Cascais, Portugal
Tue 15 Jan 2019 17:00 - 17:30 at Sala III - Networks and Concurrency Chair(s): Cezara Drăgoi

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 (U-PTBP), as lower bounds or when the set of parameters is partitioned in lower-bound and upper-bound parameters (L/U-PTBP).

Slides (main.pdf)297KiB

Tue 15 Jan
Times are displayed in time zone: (GMT+01:00) Greenwich Mean Time : Belfast change

16:00 - 17:30: VMCAI 2019 - Networks and Concurrency at Sala III
Chair(s): Cezara DrăgoiINRIA, ENS, CNRS
VMCAI-201916:00 - 16:30
Azalea RaadMPI-SWS, Germany, Ori LahavTel Aviv University, Viktor VafeiadisMPI-SWS, Germany
VMCAI-201916:30 - 17:00
Nuno P. LopesMicrosoft Research, Andrey RybalchenkoMicrosoft Research
VMCAI-201917:00 - 17:30
Étienne AndréLIPN, CNRS UMR 7030, Université Paris 13, Benoit Delahaye, Paulin Fournier, Didier Lime
File Attached