Abstract
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised more than 50 years ago in "Church's Synthesis Problem" that led to the foundation of the algorithmic theory of infinite games. We outline the methodology developed in more recent years for solving such games and address related automata theoretic problems that are still unresolved. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Thomas, W. (2009). Facets of synthesis: Revisiting church’s problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5504 LNCS, pp. 1–14). https://doi.org/10.1007/978-3-642-00596-1_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
