 | 2009 |
|---|
| 47 |       | Mihhail Aizatulin,
Henning Schnoor,
Thomas Wilke:
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol.
ESORICS 2009: 571-586 |
| 2008 |
|---|
| 46 | | Detlef Kähler,
Thomas Wilke:
Complementation, Disambiguation, and Determinization of Büchi Automata Unified.
ICALP (1) 2008: 724-735 |
| 2007 |
|---|
| 45 | | Klaas Ole Kürtz,
Ralf Küsters,
Thomas Wilke:
Selecting theories and nonce generation for recursive protocols.
FMSE 2007: 61-70 |
| 44 | | Ron van der Meyden,
Thomas Wilke:
Preservation of epistemic properties in security protocol implementations.
TARK 2007: 212-221 |
| 43 | | Ralf Küsters,
Thomas Wilke:
Transducer-based analysis of cryptographic protocols.
Inf. Comput. 205(12): 1741-1776 (2007) |
| 2006 |
|---|
| 42 | | Carsten Fritz,
Thomas Wilke:
Simulation Relations for Alternating Parity Automata and Parity Games.
Developments in Language Theory 2006: 59-70 |
| 41 | | Detlef Kähler,
Ralf Küsters,
Thomas Wilke:
A Dolev-Yao-Based Definition of Abuse-Free Protocols.
ICALP (2) 2006: 95-106 |
| 40 | | Michael Benedikt,
Bart Kuijpers,
Christof Löding,
Jan Van den Bussche,
Thomas Wilke:
A characterization of first-order topological properties of planar spatial data.
J. ACM 53(2): 273-305 (2006) |
| 2005 |
|---|
| 39 | | Ron van der Meyden,
Thomas Wilke:
Synthesis of Distributed Systems from Knowledge-Based Specifications.
CONCUR 2005: 562-576 |
| 38 | | Detlef Kähler,
Ralf Küsters,
Thomas Wilke:
Deciding Properties of Contract-Signing Protocols.
STACS 2005: 158-169 |
| 37 | | Kousha Etessami,
Thomas Wilke,
Rebecca A. Schuller:
Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata.
SIAM J. Comput. 34(5): 1159-1175 (2005) |
| 36 | | Carsten Fritz,
Thomas Wilke:
Simulation relations for alternating Büchi automata.
Theor. Comput. Sci. 338(1-3): 275-314 (2005) |
| 2004 |
|---|
| 35 | | Michael Benedikt,
Christof Löding,
Jan Van den Bussche,
Thomas Wilke:
A Characterization of First-Order Topological Properties of Planar Spatial Data.
PODS 2004: 107-114 |
| 34 | | Ralf Küsters,
Thomas Wilke:
Automata-Based Analysis of Recursive Cryptographic Protocols.
STACS 2004: 382-393 |
| 33 | | Denis Thérien,
Thomas Wilke:
Nesting Until and Since in Linear Temporal Logic.
Theory Comput. Syst. 37(1): 111-131 (2004) |
| 2003 |
|---|
| 32 | | Detlef Kähler,
Thomas Wilke:
Program Complexity of Dynamic LTL Model Checking.
CSL 2003: 271-284 |
| 31 | | Thomas Wilke:
Minimizing Automata on Infinite Words.
LPAR 2003: 289 |
| 2002 |
|---|
| 30 |  | Erich Grädel,
Wolfgang Thomas,
Thomas Wilke:
Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001]
Springer 2002 |
| 29 | | Carsten Fritz,
Thomas Wilke:
State Space Reductions for Alternating Büchi Automata.
FSTTCS 2002: 157-168 |
| 28 | | Ralf Küsters,
Thomas Wilke:
Deciding the First Level of the µ-Calculus Alternation Hierarchy.
FSTTCS 2002: 241-252 |
| 27 | | Denis Thérien,
Thomas Wilke:
Nesting Until and Since in Linear Temporal Logic.
STACS 2002: 455-464 |
| 26 | | Kousha Etessami,
Moshe Y. Vardi,
Thomas Wilke:
First-Order Logic with Two Variables and Unary Temporal Logic.
Inf. Comput. 179(2): 279-295 (2002) |
| 2001 |
|---|
| 25 | | Kousha Etessami,
Thomas Wilke,
Rebecca A. Schuller:
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata.
ICALP 2001: 694-707 |
| 24 | | Thomas Wilke:
Linear Temporal Logic and Finite Semigroups.
MFCS 2001: 96-110 |
| 23 | | Juraj Hromkovic,
Sebastian Seibert,
Thomas Wilke:
Translating Regular Expressions into Small -Free Nondeterministic Finite Automata.
J. Comput. Syst. Sci. 62(4): 565-588 (2001) |
| 22 | | Denis Thérien,
Thomas Wilke:
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy.
SIAM J. Comput. 31(3): 777-798 (2001) |
| 2000 |
|---|
| 21 | | Kousha Etessami,
Thomas Wilke:
An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic.
Inf. Comput. 160(1-2): 88-108 (2000) |
| 1999 |
|---|
| 20 | | Thomas Wilke:
CTL+ is Exponentially more Succinct than CTL.
FSTTCS 1999: 110-121 |
| 19 | | Martin Dickhöfer,
Thomas Wilke:
Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem.
ICALP 1999: 281-290 |
| 18 | | Thomas Wilke:
Classifying Discrete Temporal Properties.
STACS 1999: 32-46 |
| 1998 |
|---|
| 17 | | Denis Thérien,
Thomas Wilke:
Over Words, Two Variables Are as Powerful as One Quantifier Alternation.
STOC 1998: 234-240 |
| 16 | | Doron Peled,
Thomas Wilke,
Pierre Wolper:
An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages.
Theor. Comput. Sci. 195(2): 183-203 (1998) |
| 1997 |
|---|
| 15 | | Thomas Wilke:
Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic.
ICALP 1997: 347-357 |
| 14 | | Kousha Etessami,
Moshe Y. Vardi,
Thomas Wilke:
First-Order Logic with Two Variables and Unary Temporal Logic.
LICS 1997: 228-235 |
| 13 | | Sebastian Seibert,
Thomas Wilke:
Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT.
Lectures on Proof Verification and Approximation Algorithms 1997: 179-212 |
| 12 | | Juraj Hromkovic,
Sebastian Seibert,
Thomas Wilke:
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata.
STACS 1997: 55-66 |
| 11 | | Doron Peled,
Thomas Wilke:
Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator.
Inf. Process. Lett. 63(5): 243-246 (1997) |
| 1996 |
|---|
| 10 | | Doron Peled,
Thomas Wilke,
Pierre Wolper:
An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages.
CONCUR 1996: 596-610 |
| 9 | | Denis Thérien,
Thomas Wilke:
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy.
FOCS 1996: 256-263 |
| 8 | | Kousha Etessami,
Thomas Wilke:
An Until Hierarchy for Temporal Logic.
LICS 1996: 108-117 |
| 7 | | Thomas Wilke,
Haiseung Yoo:
Computing the Rabin Index of a Regular Language of Infinite Words.
Inf. Comput. 130(1): 61-70 (1996) |
| 6 | | Thomas Wilke:
An Algebraic Characterization of Frontier Testable Tree Languages.
Theor. Comput. Sci. 154(1): 85-106 (1996) |
| 1995 |
|---|
| 5 | | Thomas Wilke,
Haiseung Yoo:
Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time.
TAPSOFT 1995: 288-302 |
| 1994 |
|---|
| 4 | | Thomas Wilke:
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata.
FTRTFT 1994: 694-715 |
| 1993 |
|---|
| 3 | | Thomas Wilke:
Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability.
ICALP 1993: 347-358 |
| 2 | | Thomas Wilke:
Locally Threshold Testable Languages of Infinite Words.
STACS 1993: 607-616 |
| 1991 |
|---|
| 1 | | Thomas Wilke:
An Eilenberg Theorem for Infinity-Languages.
ICALP 1991: 588-599 |
