Wolfgang Thomas

According to our database1, Wolfgang Thomas
  • authored at least 124 papers between 1975 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
N-Memory Automata over the Alphabet N.
Proceedings of the Language and Automata Theory and Applications, 2017

Determinacy of Infinite Games: Perspectives of the Algorithmic Approach (Invited Talk).
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016
Viewpoints on "Logic activities in Europe", twenty years later.
Bulletin of the EATCS, 2016

EATCS Fellows' Advice to the Young Theoretical Computer Scientist.
Bulletin of the EATCS, 2016

Playing Games in the Baire Space.
Proceedings of the Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters and 3rd International Workshop on Synthesis of Complex Parameters, 2016

2015
Optimal strategy synthesis for request-response games.
RAIRO - Theor. Inf. and Applic., 2015

Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061).
Dagstuhl Reports, 2015

Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Composition Over the Natural Number Ordering with an Extra Binary Relation.
Proceedings of the Fields of Logic and Computation II, 2015

2014
Obituary Robert McNaughton 1924 - 2014.
Bulletin of the EATCS, 2014

Optimal Strategy Synthesis for Request-Response Games.
CoRR, 2014

Die Analyse von Kellerstrukturen: Eine Reise durch 50 Jahre Forschung.
Proceedings of the Keller, Stack und automatisches Gedächtnis, 2014

2013
Connectivity games over dynamic networks.
Theor. Comput. Sci., 2013

2012
Moving in a network under random failures: A complexity analysis.
Sci. Comput. Program., 2012

Turings Arbeiten über Berechenbarkeit - eine Einführung und Lesehilfe.
Informatik Spektrum, 2012

Editorial.
Informatik Spektrum, 2012

Languages versus ω-Languages in Regular Infinite Games.
Int. J. Found. Comput. Sci., 2012

Degrees of Lookahead in Regular Infinite Games
Logical Methods in Computer Science, 2012

Synthesis and Some of Its Challenges.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Finite Automata and the Analysis of Infinite Transition Systems.
Modern Applications of Automata Theory, 2012

2011
Trees over Infinite Structures and Path Logics with Synchronization
Proceedings of the Proceedings 13th International Workshop on Verification of Infinite-State Systems, 2011

Connectivity Games over Dynamic Networks
Proceedings of Second International Symposium on Games, 2011

Compositional Failure Detection in Structured Transition Systems.
Proceedings of the Implementation and Application of Automata, 2011

Infinite Games and Uniformization.
Proceedings of the Logic and Its Applications - 4th Indian Conference, 2011

Languages vs. ω-Languages in Regular Infinite Games.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
Preface of STACS 2007 Special Issue.
Theory Comput. Syst., 2010

"When nobody else dreamed of these things" - Axel Thue und die Termersetzung.
Informatik Spektrum, 2010

Theoretische Informatik - ein Kurzprofil.
Informatik Spektrum, 2010

Theoretische Informatik.
Informatik Spektrum, 2010

Synthesis of behavioral controllers for DES: Increasing efficiency.
Proceedings of the 10th International Workshop on Discrete Event Systems, 2010

A Game-Theoretic Approach to Routing under Adversarial Conditions.
Proceedings of the Theoretical Computer Science, 2010

Degrees of Lookahead in Regular Infinite Games.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

10501 Executive Summary - Advances and Applications of Automata on Words and Trees.
Proceedings of the Advances and Applications of Automata on Words and Trees, 12.12., 2010

10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees.
Proceedings of the Advances and Applications of Automata on Words and Trees, 12.12., 2010

On Monadic Theories of Monadic Predicates.
Proceedings of the Fields of Logic and Computation, 2010

2009
DFG Research Training Group "Algorithmic Synthesis of Reactive and Discrete-Continuous Systems (AlgoSyn)" (DFG-Graduiertenkolleg "Algorithmische Synthese reaktiver und diskret-kontinuierlicher Systeme (AlgoSyn)").
it - Information Technology, 2009

Compositionality and Reachability with Conditions on Path Lengths.
Int. J. Found. Comput. Sci., 2009

The Complexity of Reachability in Randomized Sabotage Games.
Proceedings of the Fundamentals of Software Engineering, 2009

Facets of Synthesis: Revisiting Church's Problem.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

The Reachability Problem over Infinite Graphs.
Proceedings of the Computer Science, 2009

2008
A Game Theoretic Approach to the Analysis of Dynamic Networks.
Electr. Notes Theor. Comput. Sci., 2008

Optimizing Winning Strategies in Regular Infinite Games.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations.
Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations.
Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

Model Transformations in Decidability Proofs for Monadic Theories.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

Church's Problem and a Tour through Automata Theory.
Proceedings of the Pillars of Computer Science, 2008

Optimal Strategy Synthesis in Request-Response Games.
Proceedings of the Automated Technology for Verification and Analysis, 2008

2007
Model Checking Synchronized Products of Infinite Transition Systems.
Logical Methods in Computer Science, 2007

Model Checking Synchronized Products of Infinite Transition Systems
CoRR, 2007

The role of pseudo-wires for layer 2 services in intelligent transport networks.
Bell Labs Technical Journal, 2007

Logical Refinements of Church's Problem.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

Einführung in die mathematische Logik (5. Aufl.).
Spektrum Akademischer Verlag, 2007

2006
Observations on determinization of Büchi automata.
Theor. Comput. Sci., 2006

On Intersection Problems for Polynomially Generated Sets.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Decidable Theories of the Ordering of Natural Numbers with Unary Predicates.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005
Observations on Determinization of Büchi Automata.
Proceedings of the Implementation and Application of Automata, 2005

Deterministic Automata on Unranked Trees.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Deterministic Automata on Unranked Trees.
Proceedings of the Foundations of Semistructured Data, 6.-11. February 2005, 2005

05241 Abstracts Collection - Synthesis and Planning.
Proceedings of the Synthesis and Planning, 12.-17. June 2005, 2005

05241 Executive Summary - Synthesis and Planning.
Proceedings of the Synthesis and Planning, 12.-17. June 2005, 2005

Some Perspectives of Infinite-State Verification.
Proceedings of the Automated Technology for Verification and Analysis, 2005

2004
Model Checking Synchronized Products of Infinite Transition Systems.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003
Uniform and nonuniform recognizability.
Theor. Comput. Sci., 2003

Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications.
Proceedings of the Implementation and Application of Automata, 2003

Constructing Infinite Graphs with a Decidable MSO-Theory.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Ein e-Lecture-System für die Theoretische Informatik.
Proceedings of the DeLFI 2003, 2003

2002
The Monadic Quantifier Alternation Hierarchy over Grids and Graphs.
Inf. Comput., 2002

The Monadic Theory of Morphic Infinite Words and Generalizations.
Inf. Comput., 2002

Tiling Systems over Infinite Pictures and Their Acceptance Conditions.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Solving Pushdown Games with a Sigma3 Winning Condition.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

Infinite Games and Verification (Extended Abstract of a Tutorial).
Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2001
The Engineering Challenge for Logic.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

A Short Introduction to Infinite Automata.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Logic for Computer Science: The Engineering Challenge.
Proceedings of the Informatics - 10 Years Back. 10 Years Ahead., 2001

2000
The Monadic Theory of Morphic Infinite Words and Generalizations.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Alternating Automata and Logics over Infinite Words.
Proceedings of the Theoretical Computer Science, 2000

1999
Complementation of Büchi Automata Revised.
Proceedings of the Jewels are Forever, 1999

1998
Monadic Logic and Automata: Recent Developments.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997
Automata Theory on Trees and Partial Orders.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

Ein inkrementeller Ansatz zur effizienten Synthese von Controllern aus Spezifikationen mit temporaler Logik.
Proceedings of the Formale Beschreibungstechniken für verteilte Systeme, 1997

Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words.
Proceedings of the Structures in Logic and Computer Science, 1997

1996
Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems.
Inf. Comput., 1996

Elements of an automata theory over partial orders.
Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

Einführung in die mathematische Logik (4. Aufl.).
Hochschultaschenbuch, Spektrum Akadem. Verl., ISBN: 978-3-8274-0130-4, 1996

1995
Regular Languages Defined with Generalized Quanifiers
Inf. Comput., May, 1995

On the Synthesis of Strategies in Infinite Games.
STACS, 1995

Counter-Free Automata, First-Order Logic and Star-Free Expressions.
Proceedings of the Developments in Language Theory II, 1995

1994
Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems.
Proceedings of the STACS 94, 1994

Finite-State Recognizability and Logic: from Words to Graphs.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Finite-State Strategies in Regular Infinite Games.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Mathematical logic (2. ed.).
Undergraduate texts in mathematics, Springer, ISBN: 978-3-540-94258-0, 1994

1993
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Logical Specifications of Infinite Computations.
Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

Regular Tree Languages Without Unary Symbols are Star-Free.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Tree Languages Recognizable by Regular Frontier Check.
Proceedings of the Developments in Language Theory, 1993

Semantik und Verifikation.
Proceedings of the Informatik: Grundlagen - Amwendungen, 1993

Logik in der Informatik.
Proceedings of the Informatik: Grundlagen - Amwendungen, 1993

Komplexitätstheorie und Algorithmik.
Proceedings of the Informatik: Grundlagen - Amwendungen, 1993

1992
Infinite Trees and Automation-Definable Relations over omega-Words.
Theor. Comput. Sci., 1992

Einführung in die mathematische Logik (3. Aufl.).
BI-Wissenschaftsverlag, ISBN: 978-3-411-15603-0, 1992

1991
On Logics, Tilings, and Automata.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Infinite Trees and Automaton Definable Relations over Omega-Words.
Proceedings of the STACS 90, 1990

Automata on Infinite Objects.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), 1990

1989
AMORE: A System for Computing Automata, MOnoids, and Regular Expressions.
Proceedings of the STACS 89, 1989

1988
Computation tree logic and regular omega-languages.
Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

Automata and quantifier hierarchies.
Proceedings of the Formal Properties of Finite Automata and Applications, 1988

regular Languages Defined with Generalized Quantifiers.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987
On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

A Concatenation Game and the Dot-Depth Hierarchy.
Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986
On Frontiers of Regular Trees.
ITA, 1986

1985
European Summer Meeting of the Association for Symbolic Logic: Aachen, 1983.
J. Symb. Log., 1985

1984
Logical Aspects in the Study of Tree Languages.
Proceedings of the CAAP'84, 1984

Mathematical logic.
Undergraduate texts in mathematics, Springer, ISBN: 978-0-387-90895-3, 1984

1983
A hierarchy of sets of infinite trees.
Proceedings of the Theoretical Computer Science, 1983

1982
Classifying Regular Events in Symbolic Logic.
J. Comput. Syst. Sci., 1982

1981
A Combinatorial Approach to the Theory of omega-Automata
Information and Control, March, 1981

Remark on the Star-Height-Problem.
Theor. Comput. Sci., 1981

1980
On the Bounded Monadic Theory of Well-Ordered Structures.
J. Symb. Log., 1980

1979
Star-Free Regular Sets of omega-Sequences
Information and Control, August, 1979

1975
A note on undecidable extensions of monadic second order successor arithmetic.
Arch. Math. Log., 1975

Das Entscheidungsproblem für einige Erweiterungen der Nachfolger-Arithmetik.
PhD thesis, 1975


  Loading...