• Publications
  • Influence
Automata logics, and infinite games: a guide to current research
A central aim and ever-lasting dream of computer science is to put the development of hardware and software systems on a mathematical basis which is both firm and practical. Such a scientificExpand
  • 549
  • 25
Classifying Discrete Temporal Properties
  • T. Wilke
  • Mathematics, Computer Science
  • STACS
  • 4 March 1999
TLDR
This paper surveys recent results on the classiffication 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 and first-order logic. Expand
  • 129
  • 21
Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator
TLDR
We show that every stutter-invariant propositional linear temporal property is expressible without the next-time operator. Expand
  • 171
  • 18
Incidence and prevalence of atrial fibrillation: an analysis based on 8.3 million patients.
AIMS Based on an analysis of claims-based data of 8.298 million members of two German statutory health insurance funds, the aim of this contribution is to quantify age-/gender-specificExpand
  • 257
  • 15
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
TLDR
We give efficient algorithms, beating or matching optimal known bounds, for computing a variety of simulation relations on the state space of a Buchi automaton using a unified and simple parity-game framework. Expand
  • 128
  • 15
Automata Logics, and Infinite Games
  • 471
  • 13
First-order logic with two variables and unary temporal logic
TLDR
We investigate the power of first-order logic with only two variables over /spl omega/-words and finite words, a logic denoted by FO/sup 2/, a logic we denote by unary-TL. Expand
  • 70
  • 12
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata
  • T. Wilke
  • Mathematics, Computer Science
  • FTRTFT
  • 19 September 1994
TLDR
A monadic second-order language, denoted by \(\mathcal{L}d\), is introduced for the specification of sets of timed state sequences. Expand
  • 152
  • 10
Alternating tree automata, parity games, and modal {$\mu$}-calculus
A coherent exposition of the connection of alternating tree automata and modal μ-calculus is given, advocating an automaton model specifically tailored for working with modal μ-calculus. TheExpand
  • 144
  • 9
  • PDF
Over words, two variables are as powerful as one quantifier alternation
TLDR
We show a property of strings is expressible in the two-variable fragment of first-order logic if and only if it is express ible by both a 2 and a 2 sentence. Expand
  • 129
  • 8