The power of the "always" operator in first-order temporal logic

Theoretical Computer Science

Volumn 160, Issue 1-2, 1996, Pages 271-281

  Kaminski, Michael ^a   Wong, Chung Kei ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL OPERATORS; PARALLEL PROCESSING SYSTEMS;

CONCURRENT SYSTEMS; FIRST ORDER TEMPORAL LOGIC;

FORMAL LOGIC;

EID: 0030169427     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00108-5     Document Type: Article

References (10)

1. M. Abadi, The power of temporal proofs, Theoret. Comput. Sci. 65 (1989) 35-83.
2. M. Abadi, An axiomatization of Lamport's temporal logic of actions, in: J.C.M. Baeten and J.W. Klop, eds., Proc. CONCUR'90: Theories of Concurrency: Unification and Extension, Lecture Notes in Computer Science, Vol. 458 (Springer, Berlin, 1990) 57-69.
3. M. Abadi and L. Lamport, An old-fashion recipe for real time, ACM Transactions on Programming Languages and Systems 16 (1994) 1543-1571
4. M. Abadi and Z. Manna, Nonclausal deduction in first-order temporal logic, J. ACM 37 (1990) 279-317.
5. R. Alur and T.A. Henzinger, A really temporal logic, J. ACM 41 (1994) 181-204.
6. D. Gabbay, A. Pnueli, S. Shelah and J. Stavi, On the temporal analysis of fairness, in: Proc. 7th ACM Symp. on Principles of Programming Languages (ACM, New York, 1980) 163-173.
7. G.E. Hughes and M.J. Cresswell, A Companion to Modal Logic (Methuen and Co., London, 1984).
8. L. Lamport, A temporal logic of actions, ACM Transactions on Programming Languages and Systems 16 (1994) 872-923.
9. A. Pnueli and E. Harel, Applications of temporal logics to the specification of real-time systems, in: M. Joseph, ed., Formal Techniques in Real-Time and Fault-Tolerant Systems, Lecture Notes in Computer Science, Vol. 331 (Springer, Berlin, 1988) 84-97.
10. M. Tiomkin and M. Kaminski, Semantical analysis of logic of actions, J. Logic Comput. 5 (1995) 203-212.