Probabilistic Verification

AbstractProbabilistic elements are often introduced in concurrent programs in order to solve problems that either cannot be solved efficiently or cannot be solved at all by deterministic programs. Temporal logic is often used to specify the correctness conditions of concurrent programs. The paper presents a procedure that, given a probabilistic finite state program and a (restricted) temporal logic specification, decides whether the program satisfies its specification with probability 1. The paper also presents the notion of α-fairness and shows that a program satisfies its temporal specification with probability 1 if and only if all its α-fair computations satisfy the property