Publikationen von Thomas Wilke

Publikationen am Lehrstuhl für Informatik 7

[DW99] M. Dickhöfer and Th. Wilke. Timed alternating tree automata: the automata-theoretic solution to the TCTL model checking problem. In Automata, Languages and Programming, 26th international colloquium, volume 1644 of Lecture Notes in Computer Science, pages 281-290. Springer, 1999. (c) Springer.
[Wil99b] Th Wilke. CTL+ is exponentially more succinct than CTL. In Foundations of Software Technology and Theoretical Computer Science: 19th Conference, volume 1738 of Lecture Notes in Computer Science, pages 110-121. Springer, 1999. Technical Report: [Wil99c]. (c) Springer.
[Wil99c] Th. Wilke. CTL+ is exponentially more succinct than CTL. Technical Report AIB 99-7, RWTH Aachen, Fachgruppe Informatik, 1999. Conference paper: [Wil99b].
[Wil99a] Th. Wilke. Classifying discrete temporal properties. In STACS'99, volume 1563 of Lecture Notes in Computer Science, pages 32-46. Springer, 1999. (c) Springer.
[DW98] M. Dickhöfer and Th. Wilke. The automata-theoretic method works for TCTL model checking. Technical Report 9811, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, 1998.
[PWW98] D. Peled, Th. Wilke, and P. Wolper. An algorithmic approach for checking closure properties of temporal logic specifications and omega-regular languages. Theoretical Computer Science, 195(2):183-203, 1998.
[TW98] D. Thérien and Th. Wilke. Over words, two variables are as powerful as one quantifier alternation: FO2 = Sigma2 Pi2. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 234-240, 1998.
[Wil98] Th. Wilke. Classifying discrete temporal properties. Habilitationsschrift (post-doctoral thesis), April 1998.
[EVW97] K. Etessami, M.Y. Vardi, and Th. 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. IEEE, 1997.
[HSW97] J. Hromkovic, S. Seibert, and Th. Wilke. Translating regular expressions into small epsilon-free nondeterministic automata. In STACS'97, volume 1200 of Lecture Notes in Computer Science, pages 55-66. Springer, 1997. (c) Springer.
[PW97] D. Peled and Th. Wilke. Stutter-invariant temporal properties are expressible without the next-time operator. Information Processing Letters, 63(5):243-246, 1997.
[SW97] S. Seibert and Th. Wilke. Bounds for approximating MAXLINEG3-2 and MAXEkSAT. In Lectures on Proof Verification and Approximation Algorithms, volume 1367 of Lecture Notes in Computer Science, pages 179-212. Springer, 1997. (c) Springer.
[Wil97] Th. Wilke. Star-free picture expressions are strictly weaker than first-order logic. In Automata, Languages and Programming, 24th international colloquium, volume 1256 of Lecture Notes in Computer Science, pages 347-357. Springer, 1997. (c) Springer.
[EW96] K. Etessami and Th. Wilke. An until hierarchy for temporal logic. In Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pages 108-117. IEEE, 1996.
[PWW96] D. Peled, Th. Wilke, and P. Wolper. An algorithmic approach for checking closure properties of omega-regular languages. In Concur '96: Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 596-610. Springer, 1996. (c) Springer.
[TW96a] D. Thérien and Th. 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. IEEE, 1996.
[TW96b] D. Thérien and Th. Wilke. Temporal logic and semidirect products: An effective characterization of the until hierarchy. Technical report 96-28, DIMACS, 1996. Conference paper: [TW96a].
[Wil96] Th. Wilke. An algebraic characterization of frontier testable tree languages. Theoretical Computer Science, 154(1):85-106, 1996.
[WY96] Th. Wilke and H. Yoo. Computing the Rabin index of a regular language of infinite words. Information and Computation, 130(1):61-70, 1996.
[WY95] Th. Wilke and H. Yoo. Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time. In TAPSOFT '95: Theory and Practive of Software Development, volume 915 of Lecture Notes in Computer Science, pages 288-302. Springer, 1995. (c) Springer.
[Wil94b] Th. Wilke. Specifying timed state sequences in powerful decidable logics and timed automata. In Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 863 of Lecture Notes in Computer Science, pages 694-715. Springer, 1994. (c) Springer.
[Wil94a] Th. Wilke. Automaten und Logiken zur Beschreibung zeitabhängiger Systeme. Technical Report 9408, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, 1994.
[Wil93a] Th. Wilke. An algebraic theory for regular languages of finite and infinite words. International Journal Algebra and Computation, 3(4):447-489, 1993.
[Wil93d] Th. Wilke. Locally threshold testable languages of infinite words. In STACS'93, volume 665 of Lecture Notes in Computer Science, pages 607-616. Springer, 1993. (c) Springer.
[Wil93b] Th. Wilke. Algebras for classifying regular tree languages and an application to frontier testability. In Automata, Languages and Programming, 20th international colloquium, volume 700 of Lecture Notes in Computer Science, pages 347-358. Springer, 1993. (c) Springer.
[Wil93c] Th. Wilke. Algebras for classifying regular tree languages and an application to frontier testability. Technical Report 9313, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, 1993. Conference paper: [Wil93b].
[Wil92b] Th. Wilke. Locally threshold testable languages of infinite words. Technical Report 9203, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, 1992. Conference paper: [Wil93d].
[Wil92a] Th. Wilke. An algebraic theory for regular languages of finite and infinite words. Technical Report 9202, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, 1992. Journal version: [Wil93a].
[Wil91] Th. Wilke. An Eilenberg Theorem for omega-languages. In Automata, Languages and Programming, 18th international colloquium, volume 510 of Lecture Notes in Computer Science, pages 588-599. Springer, 1991. (c) Springer.