Automatic verification of probabilistic free choice

Lenore Zuck, Amir Pnueli, Yonit Kesten

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations


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.

Original languageEnglish
Title of host publicationVerification, Model Checking, and Abstract Interpretation - Third International Workshop, VMCAI 2002, Revised Papers
EditorsAgostino Cortesi
PublisherSpringer Verlag
Number of pages17
ISBN (Print)3540436316, 9783540436317
StatePublished - 1 Jan 2002
Event3rd International Workshop on Verification, Model Checking, and Abstract Interpretation, VMCAI 2002 - Venice, Italy
Duration: 21 Jan 200222 Jan 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2294 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd International Workshop on Verification, Model Checking, and Abstract Interpretation, VMCAI 2002

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Automatic verification of probabilistic free choice'. Together they form a unique fingerprint.

Cite this