Termination of Probabilistic Concurrent Program

@article{Hart1983TerminationOP,
  title={Termination of Probabilistic Concurrent Program},
  author={Sergiu Hart and Micha Sharir and Amir Pnueli},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1983},
  volume={5},
  pages={356-380}
}
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, necessary and sufficient conditions are given 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… CONTINUE READING