Model Checking Concurrent Programs with Nondeterminism and Randomization

Rohit Chadha, A. Prasad Sistla & Mahesh Viswanathan
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...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.