A Temporal Logic for Proving Properties of Topologically General Executions

Information and Computation

Volumn 124, Issue 2, 1996, Pages 127-144

  Ben Eliyahu, Rachel ^a,b,c   Magidor, Menachem ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c Engineering IV   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042911174     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0010     Document Type: Article

References (19)

1. Apt, K. R., Frances, N., and Katz, S. (1988), Appraising fairness in languages for distributed programming, Distrib. Computing. 2, 226-241.
2. Abraham, U., and Magidor, M., The mutual exclusion problem - The quest for a minimal solution, submitted for publication.
3. Arnold, A., and Nivat, M. (1980), Metric interpretations of infinite trees and semantics of non-deterministic programs, Theor. Comput. Sc. 11, 181-225.
4. Alpern, B., and Schneider, F. B. (1985), Defining livenes. Inform. Process. Lett. 21, 181-185.
5. Ben-Eliyahu, R. (1987), "Proving Correctness for the General Execution." Master's thesis, Mathematics and Computer Science Institute, The Hebrew University, Jerusalem.
6. Bakker, J. W., and Zucker, J. I. (1982), Processes and the denotational semantics of concurrency, Inform. and Control 54, 70-120.
7. Cohen, S., Lehmann, D., and Pnueli, A. (1983), Symmetric and economical solutions to the mutual exclusion problem in a distributed system, in "Proceedings of the 10th International Colloquium on Automata, Languages and Programming, Barcelona, Spain, July 1983" (J. Diaz, Ed.), pp. 128-136, Springer-Verlag, Berlin/New York.
8. Dixmier, J. (1984), "General Topology." Springer-Verlag, New York.
9. Francez, N., Hoare, C. A. R., Lehmann, D. J., and de Roever, W. P. (1979), Semantics of nondeterminism, concurrency, and communication, J. Comput. System Sci. 19, 290-308.
10. Francez, N. (1986), "Fairness," Springer-Verlag, Berlin/ New York.
11. Gabbay, D., Pnueli, A., Shelah, S., and Stavi, J. (1980), On the temporal analysis of fairness, in "Conference Record of the 7th Annual ACM Symposium on Principles of Programming, Languages, Las Vegas, Nevada," pp. 163-173.
12. Kelley, J. L. (1955), "General Topology," Van Nostrand, 1995.
13. Katz, S., and Peled, D. (1990), Interleaving set temporal logic, Theoret. Comput. Sci. 75, 263-287.
14. Lamport, L. (1986), The mutual exclusion problem. 1. A theory of interprocess communication, J. Asoc. Comput. Mach. 33 (2), 313-326.
15. Lehmann, D., Pnueli, A., and Stavi, J. (1981), Impartiality, justice, and fairness: The ethics of concurrent termination, in "Proceedings of the 8th International Colloquium on Automata, Languages, and Programming, Acco, Israel," pp. 264-277.
16. Lehmann, D., and Rabin, M. (1981), On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem, in "Conference Records of the Annual ACM Symposium on Principles of Programming Languages, Williamsburg, VA," pp. 133-138.
17. Lehmann, D., and Shelah, S. (1982), Reasoning with time and chance, Informat. and Control 53, 165-198.
18. Pnueli, A. (1983), On the extremely fair treatment of probabilistic algorithms, in "STOC-83: Proceedings of the 15th ACM Symposium on Theory of Computing," pp. 278-290.
19. Vardi, M. Y. (1985), Automatic verification of probabilistic concurrent finite-state programs, in "FOCS-85: Proceedings of the 26th IEEE Symposium on Foundations of Computer Science," pp. 327-338, Comput. Soc. Press.