Abstract
This paper surveys recent results on the classification of discrete temporal properties, gives an introduction to the methods that have been developed to obtain them, and explains the connections to the theory of finite automata, the theory of finite semigroups, and to first-order logic.
Part of the research reported here was conducted while the author was postdoc at DIMACS as part of the Special Year on Logic and Algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
Kousha Etessami and Thomas Wilke. An until hierarchy for temporal logic. In Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pages 108–117, New Brunswick, N.J., 1996.
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.
JohanAnthonyWillem Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, Calif., 1968.
Fred Kröger. Temporal Logic of Programs. Springer, Berlin, 1987.
Leslie Lamport. Specifying concurrent program modules. ACM Trans. Programming Lang. Sys., 5(2):190–222, 1983.
Oded Maler. Finite Automata: Infinite Behavior, Learnability and Decomposition. PhD thesis, The Weizmann Institute of Science, Rehovot, Israel, 1990.
Oded Maler and Amir Pnueli. Tight bounds on the complexity of cascaded decomposition of automata. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, vol. II, pages 672–682, St. Louis, Miss., 1990.
Robert McNaughton and Seymour Papert. Counter-Free Automata. MIT Press, Cambridge, Mass., 1971.
Doron Peled and Thomas Wilke. Stutter-invariant temporal properties are expressible without the next-time operator. Inform. Process. Lett., 63(5):243–246, 1997.
Marcel P. Schützenberger. On finite monoids having only trivial subgroups. Inform, and Computation, 8:190–194, 1965.
Marcel P. Schützenberger. Sur le produit de concatenation non ambigu. Semigroup Forum, 13:47–75, 1976.
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.
Denis Thérien and Thomas Wilke. Temporal logic and semidirect products: An effective characterization of the until hierarchy. Technical report 96-28, DIMACS, Piscataway, N.J., 1996.
Denis Thérien and Thomas Wilke. Over words, two variables are as powerful as one quantifier alternation: In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 41–47, Dallas, Texas, 1998.
Thomas Wilke. Classifying discrete temporal properties. Habilitationsschrift (postdoctoral thesis), Kiel, Germany, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wilke, T. (1999). Classifying Discrete Temporal Properties. In: Meinel, C., Tison, S. (eds) STACS 99. STACS 1999. Lecture Notes in Computer Science, vol 1563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49116-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-49116-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65691-3
Online ISBN: 978-3-540-49116-3
eBook Packages: Springer Book Archive