Facets of Synthesis: Revisiting Church’s Problem

DOI10.1007/978-3-642-00596-1_1zbMath1234.68081OpenAlexW1857043531MaRDI QIDQ3617717

Wolfgang Thomas

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_1

Mathematics Subject Classification ID

Games involving graphs (91A43) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

Unnamed Item ⋮ Compositional Control Synthesis for Partially Observable Systems ⋮ Alternating traps in Muller and parity games ⋮ Church synthesis on register automata over linearly ordered data domains ⋮ Visibly pushdown modular games ⋮ Improving parity games in practice ⋮ How Much Lookahead is Needed to Win Infinite Games? ⋮ Solving Parity Games Using an Automata-Based Algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata, logics, and infinite games. A guide to current research
• Banach-Mazur Games on Graphs
• Decidability and essential undecidability
• Weak Second‐Order Arithmetic and Finite Automata
• Logical Refinements of Church’s Problem
• Fine hierarchies and Boolean terms
• Solving Sequential Conditions by Finite-State Strategies
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees
• On model checking for the \(\mu\)-calculus and its fragments

This page was built for publication: Facets of Synthesis: Revisiting Church’s Problem