Synthesis in presence of dynamic links

We consider the problem of distributed synthesis: Given a distributed architecture and a specification, can we generate a distributed algorithm that satisfies the specification?While previous work focused on static architectures and fixed message sizes, we assume that the communication network changes dynamically and that processes piggy-pack previously received messages onto current messages.Specifically, we address two processes communicating in rounds over a dynamic link. Given a network model, i.e., a set of link directions, an adversary picks, in each round, an arbitrary link from the network model. We show that the synthesis problem is decidable for a network model if and only if it does not contain the 'empty' link. For a more general setting allowing for sequences of links, the synthesis problem is decidable if and only if the number of consecutive empty links in all possible sequences is uniformly bounded from above.