TY - GEN
T1 - Automatic verification of probabilistic free choice
AU - Zuck, Lenore
AU - Pnueli, Amir
AU - Kesten, Yonit
PY - 2002/1/1
Y1 - 2002/1/1
N2 - We study automatic methods for establishing P-validity (validity with probability 1) of simple temporal properties over finite-state probabilistic systems. The proposed approach replaces P-validity with validity over a non-probabilistic version of the system, in which probabilistic choices are replaced by non-deterministic choices constrained by compassion (strong fairness) requirements. "Simple" properties are temporal properties whose only temporal operators are ◇ (eventually) and its dual □ (always). In general, the appropriate compassion requirements are "global," since they involve global states of the system. Yet, in many cases they can be transformed into "local" requirements, which enables their verification by model checkers. We demonstrate our methodology of translating the problem of P-validity into that of verification of a system with local compassion requirement on the "courteous philosophers" algorithm of [LR81], a parameterized probabilistic system that is notoriously difficult to verify, and outline a verification of the algorithm that was obtained by the tlv model checker.
AB - We study automatic methods for establishing P-validity (validity with probability 1) of simple temporal properties over finite-state probabilistic systems. The proposed approach replaces P-validity with validity over a non-probabilistic version of the system, in which probabilistic choices are replaced by non-deterministic choices constrained by compassion (strong fairness) requirements. "Simple" properties are temporal properties whose only temporal operators are ◇ (eventually) and its dual □ (always). In general, the appropriate compassion requirements are "global," since they involve global states of the system. Yet, in many cases they can be transformed into "local" requirements, which enables their verification by model checkers. We demonstrate our methodology of translating the problem of P-validity into that of verification of a system with local compassion requirement on the "courteous philosophers" algorithm of [LR81], a parameterized probabilistic system that is notoriously difficult to verify, and outline a verification of the algorithm that was obtained by the tlv model checker.
UR - http://www.scopus.com/inward/record.url?scp=84894639190&partnerID=8YFLogxK
U2 - 10.1007/3-540-47813-2_15
DO - 10.1007/3-540-47813-2_15
M3 - Conference contribution
AN - SCOPUS:84894639190
SN - 3540436316
SN - 9783540436317
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 208
EP - 224
BT - Verification, Model Checking, and Abstract Interpretation - Third International Workshop, VMCAI 2002, Revised Papers
A2 - Cortesi, Agostino
PB - Springer Verlag
T2 - 3rd International Workshop on Verification, Model Checking, and Abstract Interpretation, VMCAI 2002
Y2 - 21 January 2002 through 22 January 2002
ER -