The problem of distributed synthesis is to automatically generate a distributed algorithm, given a target communication network and a specification of the algorithm's correct behavior. Previous work has focused on static networks with an a priori fixed message size. This approach has two shortcomings: Recent work in distributed computing is shifting towards dynamically changing communication networks rather than static ones, and an important class of distributed algorithms are so-called full-information protocols, where nodes piggy-pack previously received messages onto current messages. In this work, we consider the synthesis problem for a system of two nodes communicating in rounds over a dynamic link whose message size is not bounded. Given a network model, i.e., a set of link directions, in each round of the execution, the adversary choses a link from the network model, restricted only by the specification, and delivers messages according to the current link's directions. Motivated by communication buses with direct acknowledge mechanisms, we further assume that nodes are aware of which messages have been delivered. We show that the synthesis problem is decidable for a network model if and only if it does not contain the empty link that dismisses both nodes' messages.

中文翻译：

---

存在动态链接的综合

分布式综合的问题是在给定目标通信网络和算法正确行为的规范的情况下自动生成分布式算法。以前的工作集中在具有先验固定消息大小的静态网络上。这种方法有两个缺点：分布式计算的最新工作正在转向动态变化的通信网络而不是静态的，并且一类重要的分布式算法是所谓的全信息协议，其中节点将先前收到的消息打包到当前消息上. 在这项工作中，我们考虑了两个节点在消息大小不受限制的动态链路上循环通信的系统的综合问题。给定一个网络模型，即一组链接方向，在每一轮执行中，攻击者从网络模型中选择一个仅受规范限制的链接，并根据当前链接的方向传递消息。受具有直接确认机制的通信总线的推动，我们进一步假设节点知道哪些消息已被传递。我们表明，当且仅当它不包含消除两个节点消息的空链接时，综合问题对于网络模型是可判定的。