Synthesis of Finite-state and Definable Winning Strategies

ABSTRACT. Church's Problem asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence I an output sequence O such that (I, O) satisfies . McNaughton reduced Church's Problem to a problem about two-player -games. B

• Type: Conference
• Year: 2009
• Where: FSTTCS
• Authors: Alexander Rabinovich
• Keywords: Church's Problem, Finite-state Strategies, FSTTCS 2009, Mcnaughton Reduced Church, Software Engineering