Temporal reasoning under generalized fairness constraints

1. Abrahamson, K., Decidability and Expressiveness of Logics of Processes, PhD Thesis, University of Washington, 1980.

   Google Scholar 

2. Apt, K. R., Olderog, E. R. Proof Rules and Translations Dealing with Fairness, Science of Computer Programming 3 (1983), pp. 65–100.

   Google Scholar 

3. Ben-Ari, M., Manna, Z., and Pnueli, A., The Temporal Logic of Branching Time, 8th Annual ACM Symp. on Principles of Programming Languages, 1981.

   Google Scholar 

4. Clarke, E. M., Emerson, E. A., and Sistla, A. P., Automatic Verification of Finite State Concurrent System Using Temporal Logic, 10th Annual ACM 10th Annual ACM Symp. on Principles of Programming Languages, 1983.

   Google Scholar 

5. DeBakker, J. W., Mathematical Theory of Program Correctness (Prentice-Hall, Englewood Cliffs, NJ, 1980).

   Google Scholar 

6. Emerson, E. A., and Clarke, E. M., Characterizing Correctness Properties of Parallel Programs Using Fixpoints, Proc. ICALP 80, LNCS Vol. 85, Springer Verlag, 1980, pp. 169–181.

   Google Scholar 

7. Emerson, E. A., and Clarke, E. M., Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons, Tech. Report TR-208, Univ. of Texas, 1982.

   Google Scholar 

8. Emerson, E. A., and Halpern, J. Y., Decision Procedures and Expressiveness in the Temporal Logic of Branching Time, 14th Annual ACM Symp. on Theory of Computing, 1982.

   Google Scholar 

9. Emerson, E. A., and Halpern, J. Y., "Sometimes" and "Not Never" Revisited: On Branching Versus Linear Time, 14th Annual ACM Symp. on Theory of Computing, 1982.

   Google Scholar 

10. Emerson, E. A., and Lei, C. L., Temporal Model Checking Under Generalized Fairness Constraints, to be presented at the 18th Annual Hawaii International Conference on System Sciences.

    Google Scholar 

11. Emerson, E. A., and Lei, C. L., Modalities for Model Checking: Branching Time Strikes Back, to be presented at the 12th Annual ACM Symposium on Principles of Programming Languages.

    Google Scholar 

12. Emerson, E. A., and Sistla, A. P., Deciding Branching Time Logic, 16 Annual ACM Symp. on Theory of Computing, 1984.

    Google Scholar 

13. Francez, N., and Kozen, D., Generalized Fair Termination, 11th Annual ACM Symp. on Principles of Programming Languages, 1984, pp. 46–53.

    Google Scholar 

14. Fischer, M. J., and Ladner, R. E., Propositional Dynamic Logic of Regular Programs, JCSS vol. 18, pp194–211, 1979.

    Google Scholar 

15. Grimberg, O., Francez, N., Makowsky, J. A., and deRoever, W. P., A proof rule for fair termination of guarded commands, Proc. International Symp. on Algorithmic Languages (North-Holland, Amsterdam, 1981).

    Google Scholar 

16. Kozen, D., Results on the Propositional Mu-calculus, Theoretical Computer Science, pp. 333–354, December 83.

    Google Scholar 

17. Lamport, L., Sometimes is Sometimes "Not Never" — on the temporal logic of programs, 7th Annual ACM Symp. on Principles of Programming Languages, 1980, pp. 174–185.

    Google Scholar 

18. Lehmann. D., Pnueli, A., and Stavi, J., Impartiality, Justice and Fairness: The Ethics of Concurrent Termination, ICALP 1981, LNCS Vol. 115, pp 264–277.

    Google Scholar 

19. Lichtenstein, O. and Pnueli, A., Checking that Finite State Concurrent Programs Satisfy their Linear Specification, unpublished manuscript, July 84, (to appear in POPL85.)

    Google Scholar 

20. Manna, Z., and Pnueli, A., The modal logic of programs, Proc. 6th Int. Colloquium on Automata, Languages, and Programming, Springer-Verlag Lecture Notes in Computer Science #71, pp. 385–410, 1979.

    Google Scholar 

21. Manna, Z., and Wolper, P., Synthesis of Communicating Processes from Temporal Logic Specifications, TOPLAS, Vol. 6, #1, pp. 68–93.

    Google Scholar 

22. Owicki, S. S., and Lamport, L., Proving Liveness Properties of Concurrent Programs, ACM Trans. on Programming Languages and Syst., Vol. 4, No. 3, July 1982, pp. 455–495.

    Article  Google Scholar 

23. Parikh, R., A Decidability Result for a Second Order Process Logic, 17th Annual Symp. on Foundations of Computer Science, 1978.

    Google Scholar 

24. Pnueli, A., The Temporal Logic of Programs, 19th annual Symp. on Foundations of Computer Science, 1977.

    Google Scholar 

25. Pnueli, A., On The Extremely Fair Termination of Probabilistic Algorithms, 15 Annual ACM Symp. on Theory of Computing, 1983, 278–290.

    Google Scholar 

26. Pratt, V., Process Logic, 6th Annual ACM Symposium on Programming Languages, 1979.

    Google Scholar 

27. Queille, J. P., and Sifaki, J., Fairness and Related Properties in Transition Systems, Research Report #292, IMAG, Grenoble, 1982.

    Google Scholar 

28. Rabin, M. O., Weakly Definable Relations and Special Automata, in Mathematical Logic and Foundations of Set Theory, Y. Bar-Hillel, editor, North-Holland, Amsterdam, 1968, pp. 1–23.

    Google Scholar 

29. Vardi, M. and Wolper, P., Automata Theoretic Techniques for Modal Logics of Programs, pp. 446–455, STOC84.

    Google Scholar 

Download references