Skip to main content
SpringerLink
Log in

Linear Temporal Logic and Finite Semigroups

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2001 (MFCS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2136))

  • 905 Accesses

Abstract

This paper gives a gentle introduction to the semigroup-theoretic approach to classifying discrete temporal properties and surveys the most important results.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Jorge Almeida. Finite Semigroups and Universal Algebra, volume 3 of Series in Algebra. World Scientific, Singapore, 1995.

    Google Scholar 

  2. Joëlle Cohen, Dominique Perrin, and Jean-Eric Pin. On the expressive power of temporal logic. J. Comput. System Sci., 46(3):271–294, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  3. Samuel Eilenberg. Automata, Languages, and Machines, volume 59-B of Pure and Applied Mathematics. Academic Press, New York, 1976.

    MATH  Google Scholar 

  4. Allen E. Emerson. Temporal and modal logic. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, pages 995–1072. Elsevier Science Publishers B. V., Amsterdam, 1990.

    Google Scholar 

  5. Kousha Etessami, Moshe Y. Vardi, and Thomas Wilke. First-order logic with two variables and unary temporal logic. In Proceedings 12th Annual IEEE Symposium on Logic in Computer Science, pages 228–235, Warsaw, Poland, 1997.

    Google Scholar 

  6. Dov M. Gabbay, Ian Hodkinson, and Mark Reynolds. Temporal Logic: Mathematical Foundations and Computational Aspects, vol. 1 of Oxford Logic Guides. Clarendon Press, Oxford, 1994.

    MATH  Google Scholar 

  7. Dov M. Gabbay, Amir Pnueli, Saharon Shelah, and Jonathan Stavi. On the temporal analysis of fairness. In Conference Record of the 12th ACM Symposium on Principles of Programming Languages, pages 163–173, Las Vegas, Nev., 1980.

    Google Scholar 

  8. Johan Anthony Willem Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, Calif., 1968.

    Google Scholar 

  9. Fred Kröger. LAR: A logic of algorithmic reasoning. Acta Informatica, 8(3), 1977.

    Google Scholar 

  10. Robert McNaughton and Seymour Papert. Counter-Free Automata. MIT Press, Cambridge, Mass., 1971.

    MATH  Google Scholar 

  11. Jean-Eric Pin. Varieties of Formal Languages. Plenum Press, New York, 1986.

    MATH  Google Scholar 

  12. Amir Pnueli. The temporal logic of programs. In 18th Annual Symposium on Foundations of Computer Science, pages 46–57, Rhode Island, Providence, 1977.

    Google Scholar 

  13. Marcel P. Schützenberger. On finite monoids having only trivial subgroups. Inform, and Computation, 8:190–194, 1965.

    MATH  Google Scholar 

  14. Ben Steinberg. Semidirect products of categories and applications. Journal of Pure and Applied Algebra, 142:153–182, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  15. Howard Straubing. Finite semigroup varieties of the form V * D. J. Pure Appl. Algebra, 36:53–94, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  16. Denis Thérien and Alex Weiss. Graph congruences and wreath products. J. Pure Appl. Algebra, 36:205–215, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  17. Denis Thérien and Thomas Wilke. Temporal logic and semidirect products: An effective characterization of the until hierarchy. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 256–263, Burlington, Vermont, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CAU, Kiel, Germany

    Thomas Wilke

Authors
  1. Thomas Wilke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Institute, AS CR, Žitná 25, 115 67, Praha 1, Czech Republic

    Jiří Sgall

  2. Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI), Charles University, Malostranské náměstí 25, 118 00, Praha 1, Czech Republic

    Aleš Pultr  & Petr Kolman  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wilke, T. (2001). Linear Temporal Logic and Finite Semigroups. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-44683-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42496-3

  • Online ISBN: 978-3-540-44683-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation