The complexity of the temporal logic with "until" over general linear time

Journal of Computer and System Sciences

Volumn 66, Issue 2, 2003, Pages 393-426

  Reynolds, M ^a  

^a MURDOCH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; LINEARIZATION; NATURAL LANGUAGE PROCESSING SYSTEMS; PROBLEM SOLVING; SET THEORY; VARIATIONAL TECHNIQUES;

LINEAR FLOWS; LINEAR TIME; NATURAL NUMBERS; TEMPORAL LOGICS;

FORMAL LOGIC;

EID: 23844553226     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00005-9     Document Type: Article

References (35)

1. H. Barringer, R. Kuiper, A. Pnueli, A really abstract concurrent model and its temporal logic, in: Proceedings of the Thirteenth ACM Symposium on the Principles of Programming Languages, St. Petersberg Beach, FL, January 1986, ACM, New York.
2. J.P. Burgess, Axioms for tense logic I: "Since" and "Until", Notre Dame J. Formal Logic 23 (2) (1982) 367-374.
3. J.P. Burgess, Y. Gurevich, The decision problem for linear temporal logic, Notre Dame J. Formal Logic 26 (2) (1985) 115-128.
4. E.A. Emerson, Temporal and modal logic, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B, Eisevier, Amsterdam, 1990.
5. D. Gabbay, I. Hodkinson, M. Reynolds, Temporal Logic: Mathematical Foundations and Computational Aspects, Vol. 1, Oxford University Press, Oxford, 1994.
6. D.M. Gabbay, I.M. Hodkinson, M.A. Reynolds, Temporal expressive completeness in the presence of gaps, in: J. Oikkonen, J. Väänä nen (Eds.), Logic Colloquium '90, Proceedings ASL European Meeting 1990, Helsinki, Lecture Notes in Logic, Vol. 2, Springer, Berlin, 1993, pp. 89-121.
7. D.M. Gabbay, A. Pnueli, S. Shelah, J. Stavi, On the temporal analysis of fairness, in: Seventh ACM Symposium on Principles of Programming Languages, Las Vegas, 1980, pp. 163-173.
8. Y. Gurevich, Elementary properties of ordered abelian groups, Algebra and Logic 3 (1964) 5-39
9. (Russian; an English version is in Trans. Amer. Math. Soc. 46 (1965) 165-192).
10. R. Hirsch, I. Hodkinson, M. Marx, S. Mikulás, M. Reynolds, Mosaics and step-by-step. Remarks on "A modal logic of relations", in: E. Orlowska (Ed.), Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, Studies in Fuzziness and Soft Computing, Vol. 24, Springer, Berlin, 1999, pp. 158-167.
11. J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
12. H. Kamp, Tense logic and the theory of linear order, Ph.D. Thesis, University of California, Los Angeles, 1968.
13. Y. Kesten, Z. Manna, A. Pnueli, Temporal verification of simulation and refinement, in: A Decade of Concurrency: Reflections and Perspective: REX School/Symposium, Noordwijkerhout, the Netherlands, June 1-4, 1993, Springer, Berlin, 1994, pp. 273-346.
14. H. Läuchli, J. Leonard, On the elementary theory of linear order, Fund. Math. 59 (1966) 109-116.
15. M. Marx, S. Mikulas, M. Reynolds, The mosaic method for temporal logics, in: R. Dyckhoff (Ed.), Automated Reasoning with Analytic Tableaux and Related Methods, Proceedings of International Conference, TABLEAUX 2000, Saint Andrews, Scotland, July 2000, LNAI, Vol. 1847, Springer, Berlin, 2000, pp. 324-340.
16. R. McNaughton, Testing and generating infinite sequences by finite automata. Informa. and Control 9 (1966) 521-530.
17. A.R. Meyer, Weak monadic second order theory of successor is not elementary-recursive, in: Proceedings, Logic Colloquium, Springer Lecture Notes in Mathematics, Vol. 453, Springer, Berlin, 1975, pp. 132-154.
18. I. Németi, Free algebras and decidability in algebraic logic, Ph.D. Thesis, Hungarian Academy of Sciences, Budapest, 1986 (in Hungarian).
19. I. Németi, Decidable version of first order logic and cylindric-relativized set algebras, in: L. Csirmaz, D. Gabbay, M. de Rijke (Eds.), Logic Colloquium '92, CSLI Publications, Stanford, 1995, pp. 171-241.
20. H. Ono, A. Nakamura, On the size of refutation Kripke models for some linear modal and tense logics, Studia Logica 39 (1980) 325-333.
21. A. Pnueli, The temporal logic of programs, in: Proceedings of the Eighteenth IEEE Symposium on Foundations of Computer Science, Providence, RI, 1977, pp. 46-57.
22. V.R. Pratt, Models of program logics, in: Proceedings 20th IEEE Symposium on Foundations of Computer Science, San Juan, 1979, pp. 115-122.
23. A. Prior, Time and Modality, Oxford University Press, Oxford, 1957.
24. M.O. Rabin, Decidability of second order theories and automata on infinite trees, Amer. Math. Soc. Trans. 141 (1969) 1-35.
25. A. Rabinovich, On the decidability of continuous time specification formalisms, J. Logic Comput. 8 (1998) 669-678.
26. M. Reynolds, An axiomatization for Until and Since over the reals without the IRR rule, Studia Logica 51 (1992) 165-193.
27. M. Reynolds, A decidable temporal logic of parallelism, Notre Dame J. Formal Logic 38 (3) (1997) 419-436.
28. M. Reynolds, The complexity of the temporal logic over the reals, submitted. Version available at http://www.it.murdoch.edu.au/~mark/research/ online.
29. W.J. Savitch, Relationships between non-deterministic and deterministic tape complexities, J. Comput. System Sci. 4 (1970) 177-192.
30. A. Sistla, E. Clarke, Complexity of propositional linear temporal logics, J. ACM 32 (1985) 733-749.
31. A. Sistla, L. Zuck, Reasoning in a restricted temporal logic, J. Inform. Comput. 102 (2) (1993) 167-195.
32. L. Stockmeyer, The complexity of decision problems in automata and logic, Ph.D. Thesis, MIT Press, Cambridge, MA, 1974.
33. P. van Emde Boas, Machine models and simulations, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. A, Elsevier, Amsterdam, 1990.
34. M. Vardi, L. Stockmeyer, Improved upper and lower bounds for modal logics of programs, in: 17th ACM Symposium on Theory of Computing, Proceedings, ACM, New York, 1985, pp. 240-251.
35. Y. Venema, M. Marx, A modal logic of relations, in: E. Orlowska (Ed.), Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa, Springer, Berlin, 1999.