We present a new inductive rule for verifying lower bounds on expected values of random variables after execution of probabilistic loops as well as on their expected runtimes. Our rule is simple in the sense that loop body semantics need to be applied only finitely often in order to verify that the candidates are indeed lower bounds. In particular, it is not necessary to find the limit of a sequence as in many previous rules.

翻译：我们提出了一个新的推理规则,用于在进行概率循环以及预期运行时间后核查随机变量的预期值的较低限值。 我们的规则很简单,因为循环体语义需要经常有限度地应用,以核实候选人确实处于较低限值。 特别是,没有必要像以前的许多规则那样找到序列的界限。