弱vs.自我vs.概率稳定
Weak vs. Self vs. Probabilistic Stabilization
摘要：
自稳定性是一种强性质，它保证网络总是从任意初始状态开始恢复正确的行为。后来引入了更弱的保证来处理不可能的结果：概率稳定化只给出了正确行为的概率收敛。此外，弱稳定性只给出了收敛的可能性。在本文中，我们调查的相对权力弱，自我和概率稳定，相对于可以解决的问题。我们正式证明，在这个意义上，弱稳定严格强于自稳定。此外，我们完善了以前的弱稳定的结果证明，对于实际的调度实例，一个确定性的弱稳定协议可以变成一个概率自稳定的。后一个结果暗示了弱稳定化的更实际的应用，因为这样的算法比它们的（概率）自稳定对应物更容易设计和证明。
英文摘要：
Self-stabilization is a strong property that guarantees that a network always resume correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic stabilization only gives probabilistic convergence to a correct behavior. Also, weak stabilization only gives the possibility of convergence. In this paper, we investigate the relative power of weak, self, and probabilistic stabilization, with respect to the set of problems that can be solved. We formally prove that in that sense, weak stabilization is strictly stronger that self-stabilization. Also, we refine previous results on weak stabilization to prove that, for practical schedule instances, a deterministic weak-stabilizing protocol can be turned into a probabilistic self-stabilizing one. This latter result hints at more practical use of weak-stabilization, as such algorthms are easier to design and prove than their (probabilistic) self-stabilizing counterparts.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
