随机分布算法的时间界证明
Proving time bounds for randomized distributed algorithms
摘要：
在一个新的通用随机算法描述和推理框架的背景下，提出了一种分析随机分布式算法时间界的方法。该方法包括证明U（t）->（p）U '形式的辅助语句，这意味着每当算法以概率p开始于集合U中的状态时，它将在时间t内到达集合U'中的状态。该方法的力量说明了它的使用证明一个恒定的上界上的预期时间为某些过程达到其临界区域，在莱曼和拉宾的哲学家用餐算法。
英文摘要：
A method of analyzing time bounds for randomized distributed algorithms is presented, in the context of a new and general framework for describing and reasoning about randomized algorithms. The method consists of proving auxiliary statements of the form U (t)->(p) U', which means that whenever the algorithm begins in a state in set U, with probability p, it will reach a state in set U' within time t. The power of the method is illustrated by its use in proving a constant upper bound on the expected time for some process to reach its critical region, in Lehmann and Rabin's Dining Philosophers algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
