Termination of Probabilistic Concurrent Programs

@inproceedings{Hart1982TerminationOP,
  title={Termination of Probabilistic Concurrent Programs},
  author={Sergiu Hart and Micha Sharir and Amir Pnueli},
  booktitle={POPL},
  year={1982}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 159 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 98 extracted citations

Counterexample Generation in Probabilistic Model Checking

IEEE Transactions on Software Engineering • 2009
View 7 Excerpts
Highly Influenced

A Formal Approach to Probabilistic Termination

TPHOLs • 2002
View 4 Excerpts
Highly Influenced

Reasoning about Probabilistic Parallel Programs

ACM Trans. Program. Lang. Syst. • 1994
View 4 Excerpts
Highly Influenced

Termination of nondeterministic quantum programs

Acta Informatica • 2013
View 3 Excerpts
Highly Influenced

Probabilistic ω-automata

View 4 Excerpts
Highly Influenced

159 Citations

051015'83'90'98'06'14
Citations per Year
Semantic Scholar estimates that this publication has 159 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…