Complete proof system for QPTL

Journal of Logic and Computation

Volumn 12, Issue 5, 2002, Pages 701-745

  Kesten, Yonit ^a   Pnueli, Amir ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Axiomatic system; B chi automata; Completeness; Flexible variables; History scheme; Prophesy scheme; Refinement; Rigid variable; Temporal logic

Indexed keywords

AUTOMATA THEORY; BOOLEAN ALGEBRA; MATHEMATICAL TRANSFORMATIONS; SEMANTICS; SPECIFICATIONS;

AXIOMATIC SYSTEM; QUANTIFIED PROPOSITIONAL TEMPORAL LOGIC (QPTL);

FORMAL LOGIC;

EID: 0036800259     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/12.5.701     Document Type: Article

References (35)

1. M. Abadi. The power of temporal proofs. Theoretical Computer Science, 65, 35-84, 1989.
2. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82, 253-284, 1991.
3. H. Andreka, I. Nemeti, and I. Sain. Completeness problems in verification of programs and program schemes. In Fourth Mathematical Foundations of Computer Science (MFCS 79), volume 74 of Lecture Notes in Computer Science, pp. 208-218. Springer-Verlag, 1979.
4. B. Banieqbal and H. Barringer. A study of an extended temporal logic and a temporal fixed point calculus. Technical report, University of Manchester, UMCS-86-10-2, 1986.
5. J.R. Buchi. On a decision method in resricted second-order arithmetics. In International Congress on Logic, Method and Philosophical Science, pp. 1-12. Stanford University Press, 1962.
6. S.A. Cook. Soundness and completeness of an axiom system for program verification. SIAM Journal of Computing, 7, 70-90, 1978.
7. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42, 857-907, 1995.
8. D. Gabbay. The declarative past and imperative future. In Temporal Logic in Specification, volume 398 of Lecture Notes in Computer Science, B. Banieqbal, H. Barringer, and A. Pnueli, eds, pp. 407-448. Springer-Verlag, 1987.
9. D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proceedings of the Seventh ACM Symposium on Principles of Progrramming Languages, pp. 163-173, 1980.
10. I. Hodkinson. On Gabbay's Temporal Fixed Point Operator. Theoretical Computer Science, 139, 1-25, 1995.
11. I. Hodkinson, F. Wolter, and M. Zakharyaschev. Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic, 106, 85-134, 2000.
12. B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Uppsala University, Sweden, 1987.
13. J.A.W. Kamp. Tense Logic and the Theory of Order. PhD thesis, UCLA, 1968.
14. N. Klarlund. Progress measures for complementation of ω-antomata with applications to temporal logic. In Proceedings of the Thirty-second FOCS, pp. 358-367, 1991.
15. Y. Kesten, Z. Manna, and A. Pnueli. Temporal verification of simulation and refinement. In A Decade of Concurrency, volume 803 of Lecture Notes in Computer Science, J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, eds, pp. 273-346. Springer-Verlag, 1994.
16. O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. In Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pp. 147-158, 1997.
17. L. Lamport. Specifying concurrent program modules. ACM Transactions Programming Languages and Systems, 5, 190-222, 1983.
18. L. Lamport. The temporal logic of actions. ACM Transactions Programming Languages and Systems, 16, 872-923, 1994.
19. O. Lichtenstein. Decidability, Completeness, and Extensions of Linear Time Temporal Logic. PhD thesis, The Weizmann Institute if Science, Israel, 1991.
20. O. Lichtenstein and A. Pnueli. Propositional temporal logics: Decidability and completeness. Logic Journal of the IGPL, 8, 1-31, 2000.
21. O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In Proceedings of the Conference on Logics of Programs, volume 193 of Lecture Notes in Computer Science, pp. 196-218. Springer-Verlag, 1985.
22. S.S. Lam and A.U. Shankar. Protocol verification via projections. IEEE Transactions on Software Engineering, 10, 325-342, 1984.
23. N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, pp. 137-151, 1987.
24. R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9, 521-530, 1966.
25. M. Michel. Complementation is more difficult with automata on infinite words. Manuscript, 1988.
26. R. McNaughton and S. Papert. Counter Free Automata. MIT Press, 1971.
27. Z. Manna and A. Pnueli. How to cook a temporal proof system for your pet language. In Proceedings of the Tenth ACM Symp. Principles of Programming Languages, pp. 141-154, 1983.
28. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer Verlag, New York, 1991.
29. A.R. Meyer and L.J. Stockmeyer. Non-elementary word problems in automata and logic. In Proceedings of the AMS Symposium on Complexity of Computation, April 1973.
30. S. Safra. On the complexity of ω-automata. In Proceedings of the Twenty-ninth IEEE Symposium on Foundations of Computer Science, pp. 319-327, 1988.
31. D. Siefkes. Decidable Theories I - Büchi's Monadic Second-order Successor Arithmetics. Volume 120 of Lecture Notes in Mathematics, Springer-Verlag, 1970.
32. A.P. Sistla, M.Y. Vardi, and P. Wolper. The complementation problem for Büchi autamata with application to temporal logic. Theoretical Computer Science, 49, 217-237, 1987.
33. A. Szalas. Concerning the semantic consequence relation in first-order temporal logic. Theoretical Computer Science, 47, 329-334, 1986.
34. P. Wolper. Temporal logic can be more expressive. Information and Control, 56, 72-99, 1983.
35. F. Wolter and M. Zakharyaschev. Axiomatizing the monodic fragment of first-order temporal logic. Annals of Pure and Applied Logic, 2000.