The Theory of Weak Stabilization
The Theory of Weak Stabilization
复制标题
弱稳定理论
DOI：
10.1007/3-540-45438-1_8
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
M. Gouda
中科院分区：
文献类型：
--
作者：
M. Gouda
我们研究了计算系统的一种新性质，称为弱镇定。尽管这一性质严格地弱于众所周知的稳定性质，但弱稳定在几个方面优于稳定。具体地说，在系统中加入时滞可以保持系统弱镇定的性质，但不一定保持系统的镇定性质。由于大多数实现必然会给所实现的系统增加任意延迟，所以弱稳定系统比稳定系统更容易实现。我们还证明了以下重要结果。一个具有有限状态数的弱稳定系统实际上是稳定的，假设系统执行是强公平的。最后，我们讨论了一种有趣的方法，将几个弱稳定系统组合成一个单一的弱稳定系统。
We investigate a new property of computing systems called weak stabilization. Although this property is strictly weaker than the well-known property of stabilization, weak stabilization is superior to stabilization in several respects. In particular, adding delays to a system preserves the system property of weak stabilization, but does not necessarily preserve its stabilization property. Because most implementations are bound to add arbitrary delays to the systems being implemented, weakly stabilizing systems are much easier to implement than stabilizing systems. We also prove the following important result. A weakly stabilizing system that has a finite number of states is in fact stabilizing assuming that the system execution is strongly fair. Finally, we discuss an interesting method for composing several weakly stabilizing systems into a single weakly stabilizing system.