TY - JOUR
T1 - CONCURRENT PROBABILISTIC PROGRAMS, OR
T2 - HOW TO SCHEDULE IF YOU MUST.
AU - Hart, Sergiu
AU - Sharir, Micha
PY - 1985
Y1 - 1985
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0022162763&partnerID=8YFLogxK
U2 - 10.1137/0214070
DO - 10.1137/0214070
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0022162763
SN - 0097-5397
VL - 14
SP - 991
EP - 1012
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
IS - 4
ER -