Classifying discrete temporal properties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1563, Issue , 1999, Pages 32-46

  Wilke, Thomas ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FIRST ORDER LOGIC; PAPER SURVEYS; SEMIGROUPS; TEMPORAL PROPERTY;

FORMAL LOGIC;

EID: 84957094484     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_3     Document Type: Conference Paper

References (17)

1. 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.
2. 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.
3. 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.
4. 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.
5. Johan Anthony Willem Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, Calif., 1968.
6. Fred Kröger. Temporal Logic of Programs. Springer, Berlin, 1987.
7. Leslie Lamport. Specifying concurrent program modules. ACM Trans. Programming Lang. Sys., 5(2):190-222, 1983.
8. Oded Maler. Finite Automata: Infinite Behavior, Learnability and Decomposition. PhD thesis, The Weizmann Institute of Science, Rehovot, Israel, 1990.
9. 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. 2, pages 672-682, St. Louis, Miss., 1990.
10. Robert McNaughton and Seymour Papert. Counter-Free Automata. MIT Press, Cambridge, Mass., 1971.
11. Doron Peled and Thomas Wilke. Stutter-invariant temporal properties are expressible without the next-time operator. Inform. Process. Lett., 63(5):243-246, 1997.
12. Marcel P. Schützenberger. On finite monoids having only trivial subgroups. Inform. and Computation, 8:190-194, 1965.
13. Marcel P. Sch¨utzenberger. Sur le produit de concatenation non ambigu. Semigroup Forum, 13:47-75, 1976.
14. 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.
15. 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.
16. 2. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 41-47, Dallas, Texas, 1998.
17. Thomas Wilke. Classifying discrete temporal properties. Habilitationsschrift (postdoctoral thesis), Kiel, Germany, 1998.