Abstract
Given a finite set of concurrent processes executing asynchronously, such that each process may use randomization in its course of execution, we consider the problem of computing the worst-case probability for the program which consists of these processes to terminate (i.e, to converge to a specified set of common goal states), under a fair interleaving scheduling of the processes. Several methods for computing this probability are presented, and characterizations of the special case in which this probability is 1 are derived. Specializations of these characterizations to the case of deterministic and nondeterministic programs are also discussed.
Work by the second author on this paper has been supported in part by the Bat-Sheva fund at Tel-Aviv University, and by ONR Grant N00014-75-C-0571 at the Courant Institute.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L.E. Dubins and L.J. Savage, “Inequalities fox Stochastic Processes; How to Gamble if You Must”, Dover, N.Y. 1976.
S. Hart, M.Sharir and A. Pnueli, “Termination of Concurrent Probabilistic Programs”, Proc. 9th POPL Conference, 1982, pp. 1–7. (also to appear in TOPLAS 1983).
D. Lehmann, A. Pnueli and J. Stavi, “Impartiality, Justice, Fairness: The Ethics of Concurrent Termination”, Proc. 8th ICALP Conference, 1981, pp. 264–277.
D. Lehmann and M.O. Rabin, “On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers' Problem”, Proc. 8th POPL Conference, 1981, pp. 133–138.
M.O. Rabin, “N Process Synchronization by a 4 log2N — valued Shared Variable”, JCSS 25 (1982) pp. 66–75.
M.O. Rabin, “The Choice Coordination Problem” Acta Informatica 17 (1982) pp.121–134.
J.Reif and P. Spirakis, “Distributed Algorithms for Synchronizing Interprocess Communication Within Real Time”, Proc. 13th STOC Conference, 1981, pp. 133–145.
J.Reif and P. Spirakis, “Unbounded Speed Variability in Distributed Communication Systems”, Proc. 9th POPL Conference, 1982, pp. 46–56.
M.Sharir, A. Pnueli and S. Hart, “The verification of Probabilistic Programs”, to appear in SIAM J. Computing.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hart, S., Sharir, M. (1983). Concurrent probabilistic program, or: How to schedule if you must. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036917
Download citation
DOI: https://doi.org/10.1007/BFb0036917
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive