TY - GEN

T1 - Termination of probabilistic concurrent programs

AU - Hart, Sergiu

AU - Sharir, Micha

AU - Pnueli, Amir

N1 - Publisher Copyright:
© 1982 ACM.

PY - 1982/1/25

Y1 - 1982/1/25

N2 - The asynchronous execution behavior of several concurrent processes, which may use randomization, is studied. Viewing each process as a discrete Markov chain over the set of common execution states, we give necessary and sufficient conditions for the processes to converge almost surely to a given set of goal states, under any fair, but otherwise arbitrary schedule, provided that the state space is finite. (These conditions can be checked mechanically.) An interesting feature of the proof method is that it depends only on the topology of the transitions and not on the actual values of the probabilities. We also show that in our model synchronization protocols that use randomization are in certain cases no more powerful than deterministic protocols. This is demonstrated by (a) Proving lower bounds on the size of a shared variable necessary to ensure mutual exlusion and lockout-free behavior of the protocol; and (b) Showing that no fully symmetric 'randomized' protocol can ensure mutual exclusion and freedom from lockout.

AB - The asynchronous execution behavior of several concurrent processes, which may use randomization, is studied. Viewing each process as a discrete Markov chain over the set of common execution states, we give necessary and sufficient conditions for the processes to converge almost surely to a given set of goal states, under any fair, but otherwise arbitrary schedule, provided that the state space is finite. (These conditions can be checked mechanically.) An interesting feature of the proof method is that it depends only on the topology of the transitions and not on the actual values of the probabilities. We also show that in our model synchronization protocols that use randomization are in certain cases no more powerful than deterministic protocols. This is demonstrated by (a) Proving lower bounds on the size of a shared variable necessary to ensure mutual exlusion and lockout-free behavior of the protocol; and (b) Showing that no fully symmetric 'randomized' protocol can ensure mutual exclusion and freedom from lockout.

UR - http://www.scopus.com/inward/record.url?scp=84976813252&partnerID=8YFLogxK

U2 - 10.1145/582153.582154

DO - 10.1145/582153.582154

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84976813252

SN - 0897910656

T3 - Conference Record of the Annual ACM Symposium on Principles of Programming Languages

SP - 1

EP - 6

BT - Proceedings of the 9th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1982

PB - Association for Computing Machinery

T2 - 9th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1982

Y2 - 25 January 1982 through 27 January 1982

ER -