Termination of probabilistic concurrent programs

19Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

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.

References Powered by Scopus

On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem

155Citations
N/AReaders
Get full text

A distributed. abstract data type implemented by a probabilistic communication scheme

34Citations
N/AReaders
Get full text

N-process synchronization by 4-log<inf>2</inf>N-valued shared variable

21Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Termination of Probabilistic Concurrent Program

113Citations
N/AReaders
Get full text

Reasoning with time and chance

92Citations
N/AReaders
Get full text

Evaluation of resilience in self-adaptive systems using probabilistic model-checking

61Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Hart, S., Sharir, M., & Pnueli, A. (1982). Termination of probabilistic concurrent programs. In Conference Record of the Annual ACM Symposium on Principles of Programming Languages (pp. 1–6). Association for Computing Machinery. https://doi.org/10.1145/582153.582154

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 8

57%

Professor / Associate Prof. 4

29%

Researcher 2

14%

Readers' Discipline

Tooltip

Computer Science 13

93%

Social Sciences 1

7%

Save time finding and organizing research with Mendeley

Sign up for free