流通代币的分离
Separation of Circulating Tokens
摘要：
自稳定分布式控制通常由令牌抽象建模。具有单个令牌的系统可以实现互斥;具有多个令牌的系统可以确保直接邻居不同时享有特权。对于网络物理系统，令牌可以表示其移动被控制的物理对象。本文研究的问题是保证一个有m个循环令牌的同步系统的令牌之间至少有d个距离。这个问题首先被认为是在一个环，其中d是给定的，而m和环的大小n是未知的。解决这个问题的协议可以是统一的，所有进程运行相同的程序，也可以是非统一的，一些进程只充当令牌中继。第一个问题的协议是简单的，可以用Petri网形式主义表示。第二个问题是当m给定且n未知时，最大化d。对于第二个问题，本文提出了一个非一致的协议与一个单一的纠正过程。
英文摘要：
Self-stabilizing distributed control is often modeled by token abstractions. A system with a single token may implement mutual exclusion; a system with multiple tokens may ensure that immediate neighbors do not simultaneously enjoy a privilege. For a cyber-physical system, tokens may represent physical objects whose movement is controlled. The problem studied in this paper is to ensure that a synchronous system with m circulating tokens has at least d distance between tokens. This problem is first considered in a ring where d is given whilst m and the ring size n are unknown. The protocol solving this problem can be uniform, with all processes running the same program, or it can be non-uniform, with some processes acting only as token relays. The protocol for this first problem is simple, and can be expressed with Petri net formalism. A second problem is to maximize d when m is given, and n is unknown. For the second problem, the paper presents a non-uniform protocol with a single corrective process.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
