Skip to main content
SpringerLink
Log in

Temporal Logics for Linear and Branching Time and Model Checking

  • Chapter
  • First Online:
Logic: Reference Book for Computer Scientists

Part of the book series: Intelligent Systems Reference Library ((ISRL,volume 245))

  • 116 Accesses

Abstract

Temporal expressions had been with humanity from the beginnings. Once the oral speeches or written texts begun, it was possible to record for contemporary and future generations reflections on time. The Flood was perceived as a time related event: after it time begun anew, time as a main factor was mentioned in earliest philosophy, e.g., in philosophy of Heraclitus of Ephesus, time flows bringing cycles of opposites, life and death, way upward and way downward.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Kohelet: In Alter, R.: The Hebrew Bible: A Translation with Commentary. W. W. Norton & Company (2018)

    Google Scholar 

  2. Ł ukasiewicz, J.: On the Principle of Contradiction in Aristotle. Kraków (1910)

    Google Scholar 

  3. Prior, A.: Time and Modality. Oxford University Press, Oxford (1957)

    MATH  Google Scholar 

  4. Pnueli, A.: The temporal logic of programs. In: FOCS: Annual Symposium on Foundations of Computer Science, pp. 46–57 (1977)

    Google Scholar 

  5. Kamp, J.: Tense logic and the theory of linear order. Ph.D. thesis, UCLA (1968)

    Google Scholar 

  6. Mazurkiewicz, A.: Concurrent program schemes and their interpretation. DAIMI Rept. PB-78, Aarhus University, Aarhus (1977)

    Google Scholar 

  7. Fischer, M.J., Ladner, R.E.: Propositional modal logic of programs. J. Comput. Syst. Sci. 18, 194–211 (1979)

    Article  MATH  Google Scholar 

  8. Sistla, A.P., Clarke, E., M.: The complexity of propositional linear temporal logic. J. ACM. 32(3), 733–749 (1985)

    Google Scholar 

  9. Demri, S., Goranko, V., Lange, M.: Temporal Logics in Computer Science. Finite-State Systems. Cambridge University Press, Cambridge, UK (2016)

    Google Scholar 

  10. Vardi, M.Y., Stockmeyer,L.: Improved upper and lower bounds for modal logics of programs: preliminary report. In: STOC85

    Google Scholar 

  11. Markey, N.: Temporal logics (2015). hal-01194612

    Google Scholar 

  12. Ladner, R.: The circuit value problem is log space complete for P. ACM SIGACT News. 7(1), 18–20 (1975). https://doi.org/10.1145/990518.990519

  13. Emerson, E.A., Lei, C.L.: Modalities for model checking: branching time logic strikes back. Sci. Comput. Program. 8(3), 275–306 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  14. Schnoebelen, P.: The complexity of temporal logic model checking. In: Advances in Modal Logic, vol. 4. World Scientific, Singapore (2003)

    Google Scholar 

  15. Wolper, P.: The tableau method for temporal logic: an overview. Logique et Anal. (N.S.) 110–111, 119–136 (1985)

    Google Scholar 

  16. Emerson, E.A., Halpern, J.Y.: Decision procedures and expressiveness in temporal logic of branching time. J. Comput. Syst. Sci. 30, 1–24 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  17. Reynolds, M.: A tableau-based decision procedure for CTL*. Form. Asp. Comput. 23(6), 739–779 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  18. Reynolds, M.: A faster Tableau for CTL*. In: Proceedings of the GandALF’2013

    Google Scholar 

  19. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (2000)

    Google Scholar 

  20. Cimatti, A., Clarke, E.M., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2: an open-source tool for symbolic model checking. In: Proceedings of the 14th International Conference CAV, pp. 359–364 (2002)

    Google Scholar 

  21. Li, J., Yao, Y., Pu, G., Zhang, L., He, J.: Aalta: an LTL satisfiability checker over infinite/finite traces. In: Proceedings of the 22nd ACM International Symposium on Foundations of Software Engineering, pp. 731–734 (2014)

    Google Scholar 

  22. Bertello, M., Gigante, N.,Montanari, A., Reynolds, M.: Leviathan: a new LTL satisfiability checking tool based on a one-pass tree-shaped tableau. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16) (2016)

    Google Scholar 

  23. Kupferman, O.: Automata theory and model checking. In: [24], 107–152

    Google Scholar 

  24. Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.): Handbook of Model Checking. Publishing, Springer Nature. Springer International (2018)

    Google Scholar 

  25. Perrin, D., Pin, J.-É.: Infinite Words. In: Automata, Semigroups, Logics and Games. Elsevier, Academic, Amsterdam (2004)

    Google Scholar 

  26. Choueka, Y.: Theories of automata on \(\omega \)-tapes: a simplified approach. J. Comput. Sci. 8, 117–141 (1974)

    MathSciNet  MATH  Google Scholar 

  27. Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Trans. Comput. Log. 2(2), 408–429 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  28. Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf. Comput. 115(1), 1–37 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  29. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2009)

    MATH  Google Scholar 

  30. Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Büchi automata with applications to temporal logic. Theor. Comput. Sci. 49, 217–237 (1987)

    Article  MATH  Google Scholar 

  31. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. Assoc. Comput. Mach. 28(1), 114–133 (1981)

    Google Scholar 

  32. Miyano, S., Hayashi, T.: Alternating finite automata on \({\omega }\)-words. Theor. Comput. Sci. 32, 321–330 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  33. Vardi, M.Y., Wilke, T.: Automata: from logics to algorithms. In: [34], 629–736

    Google Scholar 

  34. Flum, J., Grädel, E., Wilke, T. (eds.): Logic and Automata. History and Perspective. Amsterdam University Press, Amsterdam (2008)

    Google Scholar 

  35. Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. J. ACM. 47(2), 312–360 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  36. Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science B, pp. 133–191. Elsevier Science Publishers (1990)

    Google Scholar 

  37. Muller, D.E., Schupp, P.E.: Alternating automata on infinite trees. Theor. Comput. Sci. 54, 167–176 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  38. Muller, D.E., Saoudi, A., Schupp, P.E.: Alternating automata, the weak monadic theory of the tree and its complexity. In: Proceedings of the 13th International Colloquium on Automata, Languages and Programming. Springer, New York (1986)

    Google Scholar 

  39. Bryant, R.E.: Binary decision diagrams. In: Clarke, E.M., Henzinger, T.H.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 191–218. Publisher, Springer International (2018)

    Chapter  Google Scholar 

  40. Chaki, S., Gurnfinkel, A.: BBD-based symbolic model checking. In: Clarke, E.M., Henzinger, T.H.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 219–246. Publisher, Springer International (2018)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Informatics, University of Warmia and Mazury, Olsztyn, Poland

    Lech T. Polkowski

Authors
  1. Lech T. Polkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lech T. Polkowski .

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Polkowski, L.T. (2023). Temporal Logics for Linear and Branching Time and Model Checking. In: Logic: Reference Book for Computer Scientists. Intelligent Systems Reference Library, vol 245. Springer, Cham. https://doi.org/10.1007/978-3-031-42034-4_5

Download citation

Publish with us

Policies and ethics

Search

Navigation