We show the equivalence of two distributed computing models, namely reconfigurable broadcast networks (RBN) and asynchronous shared-memory systems (ASMS), that were introduced independently. Both RBN and ASMS are systems in which a collection of anonymous, finite-state processes run the same protocol. In RBN, the processes communicate by selective broadcast: a process can broadcast a message which is received by all of its neighbors, and the set of neighbors of a process can change arbitrarily over time. In ASMS, the processes communicate by shared memory: a process can either write to or read from a shared register. Our main result is that RBN and ASMS can simulate each other, i.e. they are equivalent with respect to parameterized reachability, where we are given two (possibly infinite) sets of configurations C and C' defined by upper and lower bounds on the number of processes in each state and we would like to decide if some configuration in C can reach some configuration in C'. Using this simulation equivalence, we transfer results of RBN to ASMS and vice versa. Finally, we show that RBN and ASMS can simulate a third distributed model called immediate observation (IO) nets. Moreover, for a slightly stronger notion of simulation (which is satisfied by all the simulations given in this paper), we show that IO nets cannot simulate RBN.

中文翻译：

---

可重构广播网络和异步共享内存系统是等效的

我们展示了两个独立引入的分布式计算模型的等效性，即可重构广播网络 (RBN) 和异步共享内存系统 (ASMS)。RBN 和 ASMS 都是其中一组匿名、有限状态进程运行相同协议的系统。在 RBN 中，进程通过选择性广播进行通信：一个进程可以广播一条消息，该消息被其所有邻居收到，并且进程的邻居集可以随时间任意变化。在 ASMS 中，进程通过共享内存进行通信：进程可以写入或读取共享寄存器。我们的主要结果是 RBN 和 ASMS 可以相互模拟，即它们在参数化可达性方面是等效的，其中我们给出了两组（可能是无限的）配置 C 和 C' 由每个状态中进程数量的上限和下限定义，我们想决定 C 中的某些配置是否可以达到 C' 中的某些配置。使用这种模拟等效性，我们将 RBN 的结果传输到 ASMS，反之亦然。最后，我们展示了 RBN 和 ASMS 可以模拟称为即时观察 (IO) 网络的第三种分布式模型。此外，对于稍微强一点的模拟概念（本文中给出的所有模拟都满足），我们表明 IO 网络不能模拟 RBN。我们展示了 RBN 和 ASMS 可以模拟称为即时观察 (IO) 网络的第三种分布式模型。此外，对于稍微强一点的模拟概念（本文中给出的所有模拟都满足），我们表明 IO 网络不能模拟 RBN。我们展示了 RBN 和 ASMS 可以模拟称为即时观察 (IO) 网络的第三种分布式模型。此外，对于稍微强一点的模拟概念（本文中给出的所有模拟都满足），我们表明 IO 网络不能模拟 RBN。