Skip to main content
SpringerLink
Log in
Book cover

International Conference on Implementation and Application of Automata

CIAA 2021: Implementation and Application of Automata pp 3–13Cite as

Back to the Future: A Fresh Look at Linear Temporal Logic

  • Conference paper
  • First Online:

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

Abstract

This note tells the story of how I came to understand that my work with Křetínský and Sickert on translating LTL into \(\omega \)-automata was deeply connected to a normal form for LTL, obtained 35 years ago by Lichtenstein, Pnueli and Zuck.

The work surveyed in this note was partially supported by the DFG projects 183790222 “Computer-Aided Verification of Automata Constructions for Model Checking” and 317422601 “Verified Model Checkers”, and by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 787367 “Parameterized Verification and Synthesis” (PaVeS). This paper was written while the author was participating in a program at the Simons Institute for the Theory of Computing.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    For readers familiar with LTL, the result of [33] can also be used to normalize into formulas containing also the operators \(\mathbf {R}\) and \(\mathbf {M}\). This has relevance, because the normal form with these operators can be exponentially more compact than the normal form with only the \(\mathbf {U}\) and \(\mathbf {W}\) operators.

References

  1. Chang, E., Manna, Z., Pnueli, A.: Characterization of temporal property classes. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 474–486. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55719-9_97

    Chapter  Google Scholar 

  2. Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.): Handbook of Model Checking. Springer, Heidelberg (2018)

    MATH  Google Scholar 

  3. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. J. ACM 42(4), 857–907 (1995)

    Article  MathSciNet  Google Scholar 

  4. Esparza, J., Křetínský, J.: From LTL to deterministic automata: a safraless compositional approach. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 192–208. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-08867-9_13

    Chapter  Google Scholar 

  5. Esparza, J., Kretínský, J., Sickert, S.: From LTL to deterministic automata - a safraless compositional approach. Formal Methods Syst. Des. 49(3), 219–271 (2016)

    Article  Google Scholar 

  6. Esparza, J., Kretínský, J., Sickert, S.: One theorem to rule them all: a unified translation of LTL into \(\omega \)-automata. In: LICS, pp. 384–393. ACM (2018)

    Google Scholar 

  7. Esparza, J., Kretínský, J., Sickert, S.: A unified translation of linear temporal logic to \(\omega \)-automata. J. ACM 67(6), 33:1–33:61 (2020)

    Google Scholar 

  8. Gaiser, A., Křetínský, J., Esparza, J.: Rabinizer: small deterministic automata for LTL(F, G). In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, pp. 72–76. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33386-6_7

    Chapter  MATH  Google Scholar 

  9. Holzmann, G.J.: The SPIN Model Checker - Primer and Reference Manual. Addison-Wesley, Boston (2004)

    Google Scholar 

  10. Klein, J., Baier, C.: Experiments with deterministic omega-automata for formulas of linear temporal logic. Theor. Comput. Sci. 363(2), 182–195 (2006)

    Article  Google Scholar 

  11. Klein, J., Baier, C.: On-the-fly stuttering in the construction of deterministic \(\omega \)-automata. In: Holub, J., Žd’árek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 51–61. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-76336-9_7

    Chapter  MATH  Google Scholar 

  12. Křetínský, J., Esparza, J.: Deterministic automata for the (F,G)-fragment of LTL. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 7–22. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31424-7_7

    Chapter  Google Scholar 

  13. Křetínský, J., Garza, R.L.: Rabinizer 2: small deterministic automata for \(\text{ LTL}_{\setminus \text{ GU }}\). In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 446–450. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-02444-8_32

    Chapter  MATH  Google Scholar 

  14. Křetínský, J., Meggendorfer, T., Sickert, S.: Owl: a library for \(\omega \)-words, automata, and LTL. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 543–550. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-01090-4_34

    Chapter  Google Scholar 

  15. Křetínský, J., Meggendorfer, T., Sickert, S., Ziegler, C.: Rabinizer 4: from LTL to your favourite deterministic automaton. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 567–577. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96145-3_30

    Chapter  Google Scholar 

  16. Křetínský, J.: Verification of Discrete- and Continuous-Time Non-Deterministic Markovian Systems. Ph.D. thesis, Technical University of Munich, Germany (2013). https://www.in.tum.de/en/research/publications/dissertations/

  17. Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585–591. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22110-1_47

    Chapter  Google Scholar 

  18. Lichtenstein, O., Pnueli, A., Zuck, L.: The glory of the past. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol. 193, pp. 196–218. Springer, Heidelberg (1985). https://doi.org/10.1007/3-540-15648-8_16

    Chapter  MATH  Google Scholar 

  19. Luttenberger, M., Meyer, P.J., Sickert, S.: Practical synthesis of reactive systems from LTL specifications via parity games. Acta Informatica 57(1–2), 3–36 (2020)

    Article  MathSciNet  Google Scholar 

  20. Maler, O.: On the Krohn-Rhodes cascaded decomposition theorem. In: Manna, Z., Peled, D.A. (eds.) Time for Verification. LNCS, vol. 6200, pp. 260–278. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13754-9_12

    Chapter  Google Scholar 

  21. Manna, Z., Pnueli, A.: A hierarchy of temporal properties. In: PODC, pp. 377–410. ACM (1990)

    Google Scholar 

  22. Manna, Z., Pnueli, A.: Completing the temporal picture. Theor. Comput. Sci. 83(1), 91–130 (1991)

    Article  Google Scholar 

  23. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems - Specification. Springer, Heidelberg (1992)

    Book  Google Scholar 

  24. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems - Safety. Springer, Heidelberg (1995)

    Book  Google Scholar 

  25. Manna, Z., Pnueli, A.: Temporal verification of reactive systems - progress (1996). https://theory.stanford.edu/~zm/tvors3.html

  26. Meyer, P.J., Sickert, S., Luttenberger, M.: Strix: explicit reactive synthesis strikes back!. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 578–586. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96145-3_31

    Chapter  Google Scholar 

  27. Pelánek, R., Strejček, J.: Deeper connections between LTL and alternating automata. In: Farré, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 238–249. Springer, Heidelberg (2006). https://doi.org/10.1007/11605157_20

    Chapter  MATH  Google Scholar 

  28. Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46–57. IEEE Computer Society (1977)

    Google Scholar 

  29. Pnueli, A.: The temporal semantics of concurrent programs. Theor. Comput. Sci. 13, 45–60 (1981)

    Article  MathSciNet  Google Scholar 

  30. Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 652–671. Springer, Heidelberg (1989). https://doi.org/10.1007/BFb0035790

    Chapter  Google Scholar 

  31. Safra, S.: On the complexity of omega-automata. In: FOCS, pp. 319–327. IEEE Computer Society (1988)

    Google Scholar 

  32. Sickert, S.: A unified translation of linear temporal logic to \(\omega \)-automata. Ph.D. thesis, Technical University of Munich, Germany (2019). https://www.in.tum.de/en/research/publications/dissertations/

  33. Sickert, S., Esparza, J.: An efficient normalisation procedure for linear temporal logic and very weak alternating automata. In: LICS, pp. 831–844. ACM (2020)

    Google Scholar 

  34. Sickert, S., Křetínský, J.: MoChiBA: probabilistic LTL model checking using limit-deterministic Büchi automata. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 130–137. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46520-3_9

    Chapter  Google Scholar 

  35. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: FOCS, pp. 327–338. IEEE Computer Society (1985)

    Google Scholar 

  36. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: LICS, pp. 332–344. IEEE Computer Society (1986)

    Google Scholar 

  37. Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. J. Comput. Syst. Sci. 32(2), 183–221 (1986)

    Article  MathSciNet  Google Scholar 

  38. Zuck, L.D.: Past temporal logic. Ph.D. thesis, The Weizmann Institute of Science, Israel, August 1986

    Google Scholar 

Download references

Acknowledgment

I thank Jan Křetínský and Salomon Sickert for sharing their insights with me in countless conversations, for all our joint work, and for their comments on a draft of this note.

Author information

Authors and Affiliations

  1. Technical University of Munich, Munich, Germany

    Javier Esparza

Authors
  1. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Javier Esparza .

Editor information

Editors and Affiliations

  1. University of Bremen, Bremen, Germany

    Sebastian Maneth

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Esparza, J. (2021). Back to the Future: A Fresh Look at Linear Temporal Logic. In: Maneth, S. (eds) Implementation and Application of Automata. CIAA 2021. Lecture Notes in Computer Science(), vol 12803. Springer, Cham. https://doi.org/10.1007/978-3-030-79121-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-79121-6_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-79120-9

  • Online ISBN: 978-3-030-79121-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation