Wolfgang Thomas

Dagstuhl Reports, 2015

Composition Over the Natural Number Ordering with an Extra Binary Relation.

[BibT_eX]

[DOI]

Proceedings of the Fields of Logic and Computation II, 2015

2014

Obituary Robert McNaughton 1924 - 2014.

[BibT_eX]

[DOI]

John Corcoran

Paliath Narendran

Bull. EATCS, 2014

Die Analyse von Kellerstrukturen: Eine Reise durch 50 Jahre Forschung.

[BibT_eX]

[DOI]

Proceedings of the Keller, Stack und automatisches Gedächtnis, 2014

2013

Connectivity games over dynamic networks.

[BibT_eX]

[DOI]

Sten Grüner

Theor. Comput. Sci., 2013

2012

Moving in a network under random failures: A complexity analysis.

[BibT_eX]

[DOI]

Dominik Klein

Sci. Comput. Program., 2012

Turings Arbeiten über Berechenbarkeit - eine Einführung und Lesehilfe.

[BibT_eX]

[DOI]

Uwe Schöning

Inform. Spektrum, 2012

Editorial.

[BibT_eX]

[DOI]

Franz Baader

Inform. Spektrum, 2012

Languages versus ω-Languages in Regular Infinite Games.

[BibT_eX]

[DOI]

Namit Chaturvedi

Jörg Olschewski

Int. J. Found. Comput. Sci., 2012

Degrees of Lookahead in Regular Infinite Games

[BibT_eX]

[DOI]

Michael Holtmann

Lukasz Kaiser

Log. Methods Comput. Sci., 2012

Synthesis and Some of Its Challenges.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Finite Automata and the Analysis of Infinite Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Modern Applications of Automata Theory., 2012

2011

Trees over Infinite Structures and Path Logics with Synchronization

[BibT_eX]

[DOI]

Alex Spelten

Sarah Winter

Proceedings of the Proceedings 13th International Workshop on Verification of Infinite-State Systems, 2011

Compositional Failure Detection in Structured Transition Systems.

[BibT_eX]

[DOI]

Ingo Felscher

Proceedings of the Implementation and Application of Automata, 2011

Infinite Games and Uniformization.

[BibT_eX]

[DOI]

Proceedings of the Logic and Its Applications - 4th Indian Conference, 2011

Languages vs. <i>ω</i>-Languages in Regular Infinite Games.

[BibT_eX]

[DOI]

Namit Chaturvedi

Jörg Olschewski

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010

Preface of STACS 2007 Special Issue.

[BibT_eX]

[DOI]

Pascal Weil

Theory Comput. Syst., 2010

"When nobody else dreamed of these things" - Axel Thue und die Termersetzung.

[BibT_eX]

[DOI]

Inform. Spektrum, 2010

Theoretische Informatik - ein Kurzprofil.

[BibT_eX]

[DOI]

Inform. Spektrum, 2010

Theoretische Informatik.

[BibT_eX]

[DOI]

Inform. Spektrum, 2010

Synthesis of behavioral controllers for DES: Increasing efficiency.

[BibT_eX]

[DOI]

Proceedings of the 10th International Workshop on Discrete Event Systems, 2010

A Game-Theoretic Approach to Routing under Adversarial Conditions.

[BibT_eX]

[DOI]

James Gross

Proceedings of the Theoretical Computer Science, 2010

10501 Executive Summary - Advances and Applications of Automata on Words and Trees.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Advances and Applications of Automata on Words and Trees, 12.12., 2010

On Monadic Theories of Monadic Predicates.

[BibT_eX]

[DOI]

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)").

[BibT_eX]

[DOI]

it Inf. Technol., 2009

Compositionality and Reachability with Conditions on Path Lengths.

[BibT_eX]

[DOI]

Ingo Felscher

Int. J. Found. Comput. Sci., 2009

The Complexity of Reachability in Randomized Sabotage Games.

[BibT_eX]

[DOI]

Dominik Klein

Proceedings of the Fundamentals of Software Engineering, 2009

Facets of Synthesis: Revisiting Church's Problem.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2009

Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies.

[BibT_eX]

[DOI]

Paul Hänsch

Michaela Slaats

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Synthesis of behavioral controllers for Discrete Event Systems with NCES-like Petri net models.

[BibT_eX]

[DOI]

Kai Bollue

Dirk Abel

Proceedings of the 10th European Control Conference, 2009

The Reachability Problem over Infinite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2009

2008

Optimizing Winning Strategies in Regular Infinite Games.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

Model Transformations in Decidability Proofs for Monadic Theories.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

Church's Problem and a Tour through Automata Theory.

[BibT_eX]

[DOI]

Proceedings of the Pillars of Computer Science, 2008

Optimal Strategy Synthesis in Request-Response Games.

[BibT_eX]

[DOI]

Florian Horn

Nico Wallmeier

Proceedings of the Automated Technology for Verification and Analysis, 2008

2007

Model Checking Synchronized Products of Infinite Transition Systems.

[BibT_eX]

[DOI]

Stefan Wöhrle

Log. Methods Comput. Sci., 2007

A Game Theoretic Approach to the Analysis of Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the First Workshop on Verification of Adaptive Systems, 2007

The role of pseudo-wires for layer 2 services in intelligent transport networks.

[BibT_eX]

[DOI]

Dieter Stoll

Martin Belzner

Bell Labs Tech. J., 2007

Logical Refinements of Church's Problem.

[BibT_eX]

[DOI]

Alexander Rabinovich

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

Einführung in die mathematische Logik (5. Aufl.).

[BibT_eX]

Christoph Schulte Althoff

Spektrum Akademischer Verlag, 2007

2006

Observations on determinization of Büchi automata.

[BibT_eX]

[DOI]

Nico Wallmeier

Theor. Comput. Sci., 2006

On Intersection Problems for Polynomially Generated Sets.

[BibT_eX]

[DOI]

Karianto Wong

Aloys Krieg

Alexander Moshe Rabinovich

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Decidable Theories of the Ordering of Natural Numbers with Unary Predicates.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005

Deterministic Automata on Unranked Trees.

[BibT_eX]

[DOI]

Julien Cristau

Christof Löding

Proceedings of the Foundations of Semistructured Data, 6.-11. February 2005, 2005

05241 Abstracts Collection - Synthesis and Planning.

[BibT_eX]

[DOI]

Henry A. Kautz

Moshe Y. Vardi

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

05241 Executive Summary - Synthesis and Planning.

[BibT_eX]

[DOI]

Henry A. Kautz

Moshe Y. Vardi

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

Some Perspectives of Infinite-State Verification.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2005

2003

Uniform and nonuniform recognizability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications.

[BibT_eX]

[DOI]

Nico Wallmeier

Patrick Hütten

Proceedings of the Implementation and Application of Automata, 2003

Constructing Infinite Graphs with a Decidable MSO-Theory.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Ein e-Lecture-System für die Theoretische Informatik.

[BibT_eX]

[DOI]

Philipp Rohde

Proceedings of the DeLFI 2003, 2003

2002

The Monadic Quantifier Alternation Hierarchy over Grids and Graphs.

[BibT_eX]

[DOI]

Oliver Matz

Nicole Schweikardt

Inf. Comput., 2002

The Monadic Theory of Morphic Infinite Words and Generalizations.

[BibT_eX]

[DOI]

Olivier Carton

Inf. Comput., 2002

Tiling Systems over Infinite Pictures and Their Acceptance Conditions.

[BibT_eX]

[DOI]

Jan-Henrik Altenbernd

Stefan Wöhrle

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Solving Pushdown Games with a Sigma<sub>3</sub> Winning Condition.

[BibT_eX]

[DOI]

Thierry Cachat

Jacques Duparc

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

Infinite Games and Verification (Extended Abstract of a Tutorial).

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2001

The Engineering Challenge for Logic.

[BibT_eX]

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

A Short Introduction to Infinite Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Logic for Computer Science: The Engineering Challenge.

[BibT_eX]

[DOI]

Proceedings of the Informatics - 10 Years Back. 10 Years Ahead., 2001

2000

Alternating Automata and Logics over Infinite Words.

[BibT_eX]

[DOI]

Christof Löding

Proceedings of the Theoretical Computer Science, 2000

1999

Complementation of Büchi Automata Revised.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

Die Logiken von Boole und Büchi-Elgot-Trakhtenbrot in der Beschreibung diskreter Systeme.

[BibT_eX]

[DOI]

Proceedings of the Angewandte Mathematik, 1999

1998

Monadic Logic and Automata: Recent Developments.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997

Languages, Automata, and Logic.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Formal Languages, Volume 3: Beyond Words., 1997

Automata Theory on Trees and Partial Orders.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite.

[BibT_eX]

[DOI]

Oliver Matz

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.

[BibT_eX]

Nils Buhrke

Jens Vöge

Proceedings of the Formale Beschreibungstechniken für verteilte Systeme, 1997

Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words.

[BibT_eX]

[DOI]

Proceedings of the Structures in Logic and Computer Science, 1997

1996

Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Elements of an automata theory over partial orders.

[BibT_eX]

[DOI]

Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

Einführung in die mathematische Logik (4. Aufl.).

[BibT_eX]

Hochschultaschenbuch, Spektrum Akadem. Verl., ISBN: 978-3-8274-0130-4, 1996

1995

Regular Languages Defined with Generalized Quanifiers

[BibT_eX]

[DOI]

Howard Straubing

Denis Thérien

Inf. Comput., May, 1995

On the Synthesis of Strategies in Infinite Games.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

Counter-Free Automata, First-Order Logic and Star-Free Expressions.

[BibT_eX]

Ina Schiering

Proceedings of the Developments in Language Theory II, 1995

1994

Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

Finite-State Recognizability and Logic: from Words to Graphs.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Mathematical logic (2. ed.).

[BibT_eX]

Undergraduate texts in mathematics, Springer, ISBN: 978-3-540-94258-0, 1994

1993

On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Logical Specifications of Infinite Computations.

[BibT_eX]

[DOI]

Helmut Lescow

Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

Regular Tree Languages Without Unary Symbols are Star-Free.

[BibT_eX]

[DOI]

Andreas Potthoff

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Tree Languages Recognizable by Regular Frontier Check.

[BibT_eX]

Eija Jurvanen

Andreas Potthoff

Proceedings of the Developments in Language Theory, 1993

Semantik und Verifikation.

[BibT_eX]

Proceedings of the Informatik: Grundlagen - Amwendungen, 1993

Logik in der Informatik.

[BibT_eX]

Proceedings of the Informatik: Grundlagen - Amwendungen, 1993

Komplexitätstheorie und Algorithmik.

[BibT_eX]

Kurt Mehlhorn

Volker Claus

Proceedings of the Informatik: Grundlagen - Amwendungen, 1993

1992

Infinite Trees and Automation-Definable Relations over omega-Words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Einführung in die mathematische Logik (3. Aufl.).

[BibT_eX]

BI-Wissenschaftsverlag, ISBN: 978-3-411-15603-0, 1992

1991

On Logics, Tilings, and Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990

Infinite Trees and Automaton Definable Relations over Omega-Words.

[BibT_eX]

[DOI]

Proceedings of the STACS 90, 1990

Automata on Infinite Objects.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

AMORE: A System for Computing Automata, MOnoids, and Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the STACS 89, 1989

1988

Computation tree logic and regular omega-languages.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Formal Properties of Finite Automata and Applications, 1988

regular Languages Defined with Generalized Quantifiers.

[BibT_eX]

[DOI]

Howard Straubing

Denis Thérien