- 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 Scholar
- 2 DUBINS, L.E., AND SAVAGE, L.J. Inequalities for Stochastic Processes: How to Gamble If You Must. Dover, New York, 1976.Google Scholar
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 10 RABIN, M.O. The choice coordination problem. Acta Inf. 17 (1982), 121-134.Google Scholar
- 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 Scholar
- 12 SHARIR, M., PNUELI, A., AND HART, S. The verification of probabilistic programs. SIAM J. Comput., to appear. Google Scholar
Index Terms
Termination of Probabilistic Concurrent Program
Recommendations
Probabilistic termination of CHRiSM programs
LOPSTR'11: Proceedings of the 21st international conference on Logic-Based Program Synthesis and TransformationTermination analysis has received considerable attention in Logic Programming for several decades. In recent years, probabilistic extensions of Logic Programming languages have become increasingly important. Languages like PRISM, CP-Logic, ProbLog, and ...
Distributed termination of concurrent processes in Occam
A typical tissue in concurrent programming is to ensure the correct distributed termination of processes which compose a concurrent program. A concurrent program is terminated when every process is passive and there are no messages in transit. The Oceam ...
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
Yi and Sakai [Y. Wang and M. Sakai. Decidability of termination for semi-constructor trss, left-linear shallow trss and related systems. In the 17th International Conference on Rewriting Techniques and Applications, volume 4098 of Lecture Notes in ...
Comments