Model Checking Concurrent Programs with Nondeterminism and Randomization

Authors Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan

Thumbnail PDF


  • Filesize: 0.54 MB
  • 12 pages

Document Identifiers

Author Details

Rohit Chadha
A. Prasad Sistla
Mahesh Viswanathan

Cite AsGet BibTex

Rohit Chadha, A. Prasad Sistla, and Mahesh Viswanathan. Model Checking Concurrent Programs with Nondeterminism and Randomization. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Leibniz International Proceedings in Informatics (LIPIcs), Volume 8, pp. 364-375, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound and precise model checking algorithms. In this paper, we introduce two classes of schedulers called view consistent and locally Markovian schedulers and consider the model checking problem of concurrent, probabilistic programs under these alternate semantics. Specifically, given a B\"{u}chi automaton $Spec$, a threshold $x$ in $[0,1]$, and a concurrent program $P$, the model checking problem asks if the measure of computations of $P$ that satisfy $Spec$ is at least $x$, under all view consistent (or locally Markovian) schedulers. We give precise complexity results for the model checking problem (for different classes of B\"{u}chi automata specifications) and contrast it with the complexity under the standard semantics that considers all schedulers.
  • view consistent scheduler
  • locally Markovian scheduler
  • model-checking
  • probabilistic program


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads