On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
复制标题
关于在通信顺序过程网络中寻找领导者的对称算法的存在
DOI：
10.1007/bf00263584
复制
发表时间：
1988
期刊：
影响因子：
0.6
通讯作者：
L. Bougé
中科院分区：
文献类型：
--
作者：
L. Bougé
SummaryWe定义了一个语义概念的对称性非常适合网络的过程中指定霍尔的语言CSP。然后研究了在这种网络中寻找领导者的对称算法。我们表明，这种算法的存在关键取决于网络拓扑结构和使用的输入/输出警卫的过程。因此，选举问题成为评估CSP等分布式编程语言表达能力的一个强有力的标准。
SummaryWe define a semantic notion of symmetry well-suited for networks of processes specified in Hoare's language CSP. Symmetric algorithms to find a leader in such networks are then studied. We show that the existence of such algorithms depends crucially on the network topology and on the use of input/output guards in processes. The election problem appears thus as a powerful criterion in assessing the expressive power of distributed programming languages like CSP.