2026-07-24T21:35:02Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2878 2024-03-06T10:33:40Z ddc:004 open_access

Model Checking Concurrent Programs with Nondeterminism and Randomization Chadha, Rohit Sistla, A. Prasad Viswanathan, Mahesh view consistent scheduler locally Markovian scheduler model-checking probabilistic program 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Rohit Chadha and A. Prasad Sistla and Mahesh Viswanathan 2010 Is Part Of LIPIcs, Volume 8, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2010.364 urn:nbn:de:0030-drops-28788 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.364 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode