Travelled to:
1 × Austria
1 × Cyprus
1 × Denmark
1 × Hungary
1 × Japan
1 × Poland
1 × Spain
1 × Switzerland
2 × France
2 × Germany
3 × Finland
3 × Italy
3 × United Kingdom
5 × USA
Collaborated with:
∅ S.Wöhrle N.Chaturvedi J.Olschewski N.Wallmeier I.Felscher A.Rabinovich A.M.Rabinovich O.Matz I.Schiering T.Hafer C.Czyba C.Spinrath M.Holtmann L.Kaiser K.Wong A.Krieg C.S.Althoff P.Hütten T.Cachat J.Duparc J.Altenbernd E.Jurvanen A.Potthoff H.Straubing D.Thérien
Talks about:
infinit (11) logic (9) automata (7) game (7) languag (6) regular (5) tree (5) theori (4) order (4) monad (4)
Person: Wolfgang Thomas
DBLP: Thomas:Wolfgang
Facilitated 5 volumes:
Contributed to:
Wrote 30 papers:
- DLT-2015-CzybaST #automaton #finite #infinity #modelling
- Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (CC, CS, WT), pp. 203–214.
- CAV-2012-Thomas #challenge #synthesis
- Synthesis and Some of Its Challenges (WT), p. 1.
- CIAA-2011-FelscherT #composition #detection
- Compositional Failure Detection in Structured Transition Systems (IF, WT), pp. 130–141.
- DLT-2011-ChaturvediOT #game studies #infinity
- Languages vs. ω-Languages in Regular Infinite Games (NC, JO, WT), pp. 180–191.
- DLT-J-2011-ChaturvediOT12 #game studies #infinity
- Languages versus ω-Languages in Regular Infinite Games (NC, JO, WT), pp. 985–1000.
- FoSSaCS-2010-HoltmannKT #game studies #infinity #lookahead
- Degrees of Lookahead in Regular Infinite Games (MH, LK, WT), pp. 252–266.
- FoSSaCS-2009-Thomas #problem #synthesis
- Facets of Synthesis: Revisiting Church’s Problem (WT), pp. 1–14.
- CSL-2008-Thomas #decidability #model transformation #monad #proving
- Model Transformations in Decidability Proofs for Monadic Theories (WT), pp. 23–31.
- CSL-2007-RabinovichT #logic #problem
- Logical Refinements of Church’s Problem (AR, WT), pp. 69–83.
- CSL-2006-RabinovichT #decidability
- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates (AMR, WT), pp. 562–574.
- ICALP-v2-2006-KariantoKT #on the #problem #set
- On Intersection Problems for Polynomially Generated Sets (KW, AK, WT), pp. 516–527.
- CIAA-2005-AlthoffTW #automaton
- Observations on Determinization of Büchi Automata (CSA, WT, NW), pp. 262–272.
- LICS-2004-WohrleT #infinity #model checking
- Model Checking Synchronized Products of Infinite Transition Systems (SW, WT), pp. 2–11.
- CIAA-2003-WallmeierHT #finite #specification #synthesis
- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications (NW, PH, WT), pp. 11–22.
- CAV-2002-Thomas #game studies #infinity #verification
- Infinite Games and Verification (WT), pp. 58–64.
- CSL-2002-CachatDT #automaton #game studies
- Solving Pushdown Games with a Σ₃ Winning Condition (TC, JD, WT), pp. 322–336.
- DLT-2002-AltenberndTW #infinity
- Tiling Systems over Infinite Pictures and Their Acceptance Conditions (JHA, WT, SW), pp. 297–306.
- DLT-2001-Thomas #automaton #infinity
- A Short Introduction to Infinite Automata (WT), pp. 130–144.
- LICS-2001-Thomas #challenge #logic
- The Engineering Challenge for Logic (WT), pp. 173–176.
- LICS-1998-Thomas #automaton #logic #monad
- Monadic Logic and Automata: Recent Developments (WT), pp. 136–138.
- LICS-1997-MatzT #graph #infinity #monad #quantifier
- The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite (OM, WT), pp. 236–244.
- DLT-1995-SchieringT #automaton #first-order #logic
- Counter-Free Automata, First-Order Logic and Star-Free Expressions (IS, WT), pp. 166–175.
- DLT-1993-JurvanenPT
- Tree Languages Recognizable by Regular Frontier Check (EJ, AP, WT), pp. 3–17.
- ICALP-1991-Thomas #automaton #logic #on the
- On Logics, Tilings, and Automata (WT), pp. 441–454.
- ICALP-1988-StraubingTT #quantifier #regular expression
- regular Languages Defined with Generalized Quantifiers (HS, DT, WT), pp. 561–575.
- ICALP-1987-HaferT #logic #monad #quantifier
- Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree (TH, WT), pp. 269–279.
- LICS-1987-Thomas #first-order #infinity #logic #on the
- On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees (WT), pp. 245–256.
- TAPSOFT-1993-Thomas #game studies #on the
- On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science (WT), pp. 559–568.
- TAPSOFT-1997-Thomas #automaton #partial order
- Automata Theory on Trees and Partial Orders (WT), pp. 20–38.
- CSL-2017-Thomas #algorithm #approach #game studies #infinity
- Determinacy of Infinite Games: Perspectives of the Algorithmic Approach (Invited Talk) (WT), p. 1.