CONCURRENT PROBABILISTIC PROGRAMS, OR: HOW TO SCHEDULE IF YOU MUST.

Sergiu Hart, Micha Sharir

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)991-1012
Number of pages22
JournalSIAM Journal on Computing
Volume14
Issue number4
DOIs
StatePublished - 1985

Fingerprint

Dive into the research topics of 'CONCURRENT PROBABILISTIC PROGRAMS, OR: HOW TO SCHEDULE IF YOU MUST.'. Together they form a unique fingerprint.

Cite this