skip to main content
article
Open Access

Termination of Probabilistic Concurrent Program

Authors Info & Claims
Published:01 July 1983Publication History
First page image

References

  1. 1 BURNS, J.E., FISCHER, M.J., JACKSON, P., LYNCH, N.A., AND PETERSON, G.L. Shared data requirements for implementation of mutual exclusion using a test-and-set primitive. In Proceedings of the 1978 International Conference on Parallel Processing, Aug. 22-25, 1978, pp. 79-87.Google ScholarGoogle Scholar
  2. 2 DUBINS, L.E., AND SAVAGE, L.J. Inequalities for Stochastic Processes: How to Gamble If You Must. Dover, New York, 1976.Google ScholarGoogle Scholar
  3. 3 FRANCEZ, N., ANO RODEH, M. A distributed data type implemented by a probabilistic communication scheme. In Proceedings, 21st Symposium on the Foundations of Computer Science, 1980, pp. 373-379.Google ScholarGoogle Scholar
  4. 4 HART, S., AND SHARIR, M. Concurrent probabilistic programs, or: How to schedule if you must. Tech. Rep., School of Mathematical Sciences, Tel Aviv Univ., Tel Aviv, Israel, May 1982.Google ScholarGoogle Scholar
  5. 5 HART, S., SHARIR, M., AND PNUELI, A. Termination of probabilistic concurrent programs. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, Albuquerque, N.M., Jan. 25-27, 1982, pp. 1-6. Google ScholarGoogle Scholar
  6. 6 ITAI, A., AND RODEH, M. The lord of the ring, or probabilistic methods for breaking symmetry in distributive networks. Tech. Rep. RJ 3110, IBM Corp., San Jose, Calif., 1981.Google ScholarGoogle Scholar
  7. 7 LEHMANN, D., PNUELI, A., AND STAVI, J. Impartiality, justice and fairness: The ethics of concurrent termination. In Lecture Notes in Computer Science, vol. 115: Automata, Languages and Programming;, Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981, S. Even and O. Kariv (Eds.). Springer-Verlag, New York, 1981, pp. 264-277. Google ScholarGoogle Scholar
  8. 8 LEHMANN, D., AND RABIN, M.O. On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem. In Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages, Williamsburg, Va., Jan. 26- 28, 1981, pp. 133-138. Google ScholarGoogle Scholar
  9. 9 RABIN, M.O. N process synchronization by a (4 log N)-valued shared variable. In Proceedings, 21st Symposium on the Foundations of Computer Science, 1980, pp. 407-410.Google ScholarGoogle Scholar
  10. 10 RABIN, M.O. The choice coordination problem. Acta Inf. 17 (1982), 121-134.Google ScholarGoogle Scholar
  11. 11 REiF, J., ANO SPIRAKIS, P. Distributed algorithms for synchronizing interprocess communication within real time. In Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, Milwaukee, Wis., May 11-13, 1981, pp. 133-145. Google ScholarGoogle Scholar
  12. 12 SHARIR, M., PNUELI, A., AND HART, S. The verification of probabilistic programs. SIAM J. Comput., to appear. Google ScholarGoogle Scholar

Index Terms

  1. Termination of Probabilistic Concurrent Program

                  Recommendations

                  Comments

                  Login options

                  Check if you have access through your login credentials or your institution to get full access on this article.

                  Sign in

                  Full Access

                  • Published in

                    cover image ACM Transactions on Programming Languages and Systems
                    ACM Transactions on Programming Languages and Systems  Volume 5, Issue 3
                    July 1983
                    244 pages
                    ISSN:0164-0925
                    EISSN:1558-4593
                    DOI:10.1145/2166
                    Issue’s Table of Contents

                    Copyright © 1983 ACM

                    Publisher

                    Association for Computing Machinery

                    New York, NY, United States

                    Publication History

                    • Published: 1 July 1983
                    Published in toplas Volume 5, Issue 3

                    Permissions

                    Request permissions about this article.

                    Request Permissions

                    Check for updates

                    Qualifiers

                    • article

                  PDF Format

                  View or Download as a PDF file.

                  PDF

                  eReader

                  View online with eReader.

                  eReader