Skip to main content
SpringerLink
Log in

Temporal Logics over Linear Time Domains Are in PSPACE

  • Conference paper
Reachability Problems (RP 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6227))

Included in the following conference series:

Abstract

We investigate the complexity of the satisfiability problem of temporal logics with a finite set of modalities definable in the existential fragment of monadic second-order logic. We show that the problem is in pspace over the class of all linear orders. The same techniques show that the problem is in pspace over many interesting classes of linear orders.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bedon, N., Bes, A., Carton, O., Rispal, C.: Logic and Rational Languages of Words Indexed by Linear Orderings. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol. 5010, pp. 76–85. Springer, Heidelberg (2008)

    Google Scholar 

  2. Bruyère, V., Carton, O.: Automata on linear orderings. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 236–247. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Logic, Methodology and Philosophy of Science, pp. 1–11. Stanford University Press, Stanford (1962)

    Google Scholar 

  4. Büchi, J.R., Siefkes, D.: The Monadic Second-order Theory of all Countable Ordinals. Springer Lecture Notes, vol. 328 (1973)

    Google Scholar 

  5. Burgess, J.P., Gurevich, Y.: The decision problem for linear temporal logic. Notre Dame J. Formal Logic 26(2), 115–128 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cristau, J.: Automata and temporal logic over arbitrary linear time. In: FSTTCS 2009, pp. 133–144 (2009)

    Google Scholar 

  7. Demri, S., Rabinovich, A.: The Complexity of Temporal Logic with Until and Since over Ordinals. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 531–545. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Feferman, S., Vaught, R.L.: The first-order properties of products of algebraic systems. Fundamenta Mathematicae 47, 57–103 (1959)

    MATH  MathSciNet  Google Scholar 

  9. Gabbay, D.M., Hodkinson, I., Reynolds, M.: Temporal Logics, vol. 1. Clarendon Press, Oxford (1994)

    Google Scholar 

  10. Gabbay, D.M., Pnueli, A., Shelah, S., Stavi, J.: On the Temporal Analysis of Fairness. In: 7th POPL, pp. 163–173 (1980)

    Google Scholar 

  11. Gurevich, Y.: Monadic second-order theories. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics, pp. 479–506. Springer, Heidelberg (1985)

    Google Scholar 

  12. Kamp, H.: Tense Logic and the Theory of Linear Order. Ph.D. thesis, University of California L.A (1968)

    Google Scholar 

  13. Läuchli, H., Leonard, J.: On the elementary theory of linear order. Fundamenta Mathematicae 59, 109–116 (1966)

    MATH  MathSciNet  Google Scholar 

  14. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1–35 (1969)

    MATH  MathSciNet  Google Scholar 

  15. Rabinovich, A.: Temporal logics over linear time domains are in PSPACE (manuscript) (2009)

    Google Scholar 

  16. Reynolds, M.: The complexity of the temporal logic with until over general linear time. J. Comput. Syst. Sci. 66, 393–426 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Reynolds, M.: The Complexity of Temporal Logic over the Reals. The Annals of Pure and Applied Logic 161(8), 1063–1096 (2010)

    Article  MathSciNet  Google Scholar 

  18. Rispal, C., Carton, O.: Complementation of rational sets on countable scattered linear orderings. Int. J. Found. Comput. Sci. 16(4), 767–786 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  19. Rosenstein, J.G.: Linear ordering. Academic Press, New York (1982)

    Google Scholar 

  20. Shelah, S.: The monadic theory of order. Ann. of Math. 102, 349–419 (1975)

    Article  Google Scholar 

  21. Sistla, A.P., Clarke, E.M.: The Complexity of Propositional Linear Temporal Logics. J. ACM 32(3), 733–749 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  22. Thomas, W.: Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 118–143. Springer, Heidelberg (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel, 69978

    Alexander Rabinovich

Authors
  1. Alexander Rabinovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Masaryk University, Botanická 68a, 60200, Brno, Czech Republic

    Antonín Kučera

  2. Department of Computer Science, University of Liverpool, Ashton Building, L69 3BX, Liverpool, England

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rabinovich, A. (2010). Temporal Logics over Linear Time Domains Are in PSPACE. In: Kučera, A., Potapov, I. (eds) Reachability Problems. RP 2010. Lecture Notes in Computer Science, vol 6227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15349-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15349-5_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15348-8

  • Online ISBN: 978-3-642-15349-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation