Finitary fairness

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 6, 1998, Pages 1171-1194

  Alur, Rajeev ^b   Henzinger, Thomas A ^a,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM DIAGNOSTICS; PROGRAMMING THEORY;

FINITARY FAIRNESS; PROGRAM VERIFICATION;

MULTIPROGRAMMING;

EID: 0032267451     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/295656.295659     Document Type: Article

References (26)

1. ALPERN, B. AND SCHNEIDER, F. 1985. Defining liveness. Inf. Process. Lett. 21, 181-185.
2. ALPERN, B., DEMERS, A., AND SCHNEIDER, F. 1986. Safety without stuttering. Inf. Process. Lett. 23, 177-180.
3. ALUR, R. AND DILL, D. 1994. A theory of timed automata. Theoret. Comput. Sci. 126, 183-235.
4. ALUR, R., ATTIYA, H., AND TAUBENFELD, G. 1997. Time-adaptive algorithms for synchronization. SIAM J. Comput. 26, 539-556.
5. ALUR, R., HENZINGER, T., AND VARDI, M. 1993. Parametric real-time reasoning. In Proceedings of the 25th Annual Symposium on Theory of Computing. ACM, New York, 592-601.
6. APT, K., FRANCEZ, N., AND KATZ, S. 1988. Appraising fairness in languages for distributed programming. Distrib. Comput. 2, 226-241.
7. APT, K., PNUELI, A., AND STAVI, J. 1984. Fair termination revisited with delay. Theoret. Comput. Sci. 33, 65-84.
8. BÜCHI, J. 1962. On a decision method in restricted second-order arithmetic. In Proceedings of the International Congress on Logic, Methodology, and Philosophy of Science 1960. Stanford University Press, 1-12.
9. CLARKE, E. AND EMERSON, E. 1981. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Proceedings of the Workshop on Logic of Programs. Lecture Notes in Computer Science, vol. 131. Springer-Verlag, Berlin, 52-71.
10. CLARKE, E. AND KURSHAN, R. 1996. Computer-aided verification. IEEE Spectr. 33, 61-67.
11. CLARKE, E. AND WING, J. 1996. Formal methods: State of the art and future directions. ACM Comput. Surv. 28, 626-643.
12. DWORK, C., LYNCH, N., AND STOCKMEYER, L. 1988. Consensus in the presence of partial synchrony. J. ACM 35, 288-323.
13. FISCHER, M., LYNCH, N., AND PATERSON, M. 1985. Impossibility of distributed consensus with one faulty process. J. ACM 32, 374-382.
14. FRANCEZ, N. 1986. Fairness. Springer-Verlag, Berlin.
15. GABBAY, D., PNUELI, A., SHELAH, S., AND STAVI, J. 1980. On the temporal analysis of fairness. In Proceedings of the 7th Annual Symposium on Principles of Programming Languages. ACM, New York, 163-173.
16. HENZINGER, T., MANNA, Z., AND PNUELI, A. 1994. Temporal proof methodologies for timed transition systems. Inf. Comput. 112, 273-337.
17. JAYASIMHA, D. 1988. Communication and synchronization in parallel computation. Ph.D. thesis, University of Illinois at Urbana-Champaign.
18. LEHMAN, D., PNUELI, A., AND STAVI, J. 1982. Impartiality, justice, and fairness: The ethics of concurrent termination. In Proceedings of the 9th International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 115. Springer-Verlag, Berlin, 264-277.
19. LOUI, M. AND ABU-AMARA, H. 1987. Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163-183.
20. MANNA, Z. AND PNUELI, A. 1990. A hierarchy of temporal properties. In Proceedings of the 9th Annual Symposium on Principles of Distributed Computing. ACM, New York, 377-408.
21. MANNA, Z. AND PNUELI, A. 1991. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, Berlin.
22. MERRITT, M., MODUGNO, F., AND TUTTLE, M. 1991. Time-constrained automata. In Proceedings of the Workshop on Theories of Concurrency. Lecture Notes in Computer Science, vol. 527. Springer-Verlag, Berlin, 408-423.
23. PEASE, M., SHOSTAK, R., AND LAMPORT, L. 1980. Reaching agreement in the presence of faults. J. ACM 27, 228-234.
24. RHEE, I. AND WELCH, J. 1992. The impact of time on the session problem. In Proceedings of the 11th Annual Symposium on Principles of Distributed Computing. ACM, New York, 191-201.
25. THOMAS, W. 1990. Automata on infinite objects. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B. Elsevier Science Publishers, Amsterdam, 133-191.
26. VARDI, M. 1987. Verification of concurrent programs: The automata-theoretic framework. In Proceedings of the 2nd Annual Symposium on Logic in Computer Science. IEEE, New York, 167-176.