{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T21:21:47Z","timestamp":1790112107158,"version":"4.0.1"},"reference-count":12,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,11]]},"abstract":"<jats:p>Consider a finite set of processes, such that each one may use randomizations in its course of execution; these processes are running concurrently, under a fair interleaving schedule. We analyze the worst-case probability of termination, i.e., program convergence to a specified set of goal states. Several methods for computing this probability are presented, and characterizations of the special case where it is identically 1 are derived. Specializations of these characterizations to the case of deterministic and nondeterministic programs, and to the case of programs with finite state spaces, are also discussed.<\/jats:p>","DOI":"10.1137\/0214070","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"991-1012","source":"Crossref","is-referenced-by-count":16,"title":["Concurrent Probabilistic Programs, Or: How to Schedule If You Must"],"prefix":"10.1137","volume":"14","author":[{"given":"Sergiu","family":"Hart","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micha","family":"Sharir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"RCH","volume-title":"Markov chains with stationary transition probabilities","author":"Chung Kai Lai","year":"1967"},{"key":"RDS","unstructured":"Lester E. Dubins, Leonard J. Savage, Inequalities for stochastic processes (how to gamble if you must), Dover Publications Inc., New York, 1976, 255\u201353:146180359.60002"},{"key":"RHSP","doi-asserted-by":"publisher","DOI":"10.1145\/2166.357214"},{"key":"RHS","unstructured":"S. Hart, M. Sharir,  Concurrent probabilistic programs, or how to schedule if you must, Tech. Rept., School of Mathematical Sciences, Tel Aviv University,  1982, May"},{"key":"RHS2","doi-asserted-by":"crossref","unstructured":"S. Hart, M. Sharir,  Probabilistic propositional temporal logics,  Proc. 16th Symposium on Theory of Computing,  1984,  1\u201313, April","DOI":"10.1145\/800057.808660"},{"key":"RLPS","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10843-2_22"},{"key":"RLR","doi-asserted-by":"crossref","unstructured":"D. Lehmann, M. O. Rabin,  On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers' problem,  Proc. 8th Symposium on Principles of Programming Languages,  1981,  133\u2013138","DOI":"10.1145\/567532.567547"},{"key":"RRA1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90010-1"},{"key":"RRA2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288965"},{"key":"RRS1","doi-asserted-by":"crossref","unstructured":"J. Reif, P. Spirakis,  Distributed algorithms for synchronizing interprocess communication within real time,  Proc. 13th Symposium on Theory of Computing,  1981,  133\u2013145","DOI":"10.1145\/800076.802467"},{"key":"RRS2","doi-asserted-by":"crossref","unstructured":"J. Reif, P. Spirakis,  Unbounded speed variability in distributed communication systems,  Proc. 9th Symposium on Principles of Programming Languages,  1982,  46\u201356","DOI":"10.1145\/582153.582159"},{"key":"RSPH","doi-asserted-by":"publisher","DOI":"10.1137\/0213021"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:40:09Z","timestamp":1787337609000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,11]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,11]]}},"alternative-id":["10.1137\/0214070"],"URL":"https:\/\/doi.org\/10.1137\/0214070","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,11]]}}}