@inproceedings{5d542f01322b4f85bcfa078dee25f00e,
title = "The church synthesis problem with metric",
abstract = "Church's Problem asks for the construction of a procedure which, given a logical specification φ(I, O) between input strings I and output strings O, determines whether there exists an operator F that implements the specification in the sense that φ(I, F (I)) holds for all inputs I. B{\"u}chi and Landweber gave a procedure to solve Church's problem for MSO specifications and operators computable by finite-state automata. We consider extensions of Church's problem in two orthogonal directions: (i) we address the problem in a more general logical setting, where not only the specifications but also the solutions are presented in a logical system; (ii) we consider not only the canonical discrete time domain of the natural numbers, but also the continuous domain of reals. We show that for every fixed bounded length interval of the reals, Church's problem is decidable when specifications and implementations are described in the monadic second-order logics over the reals with order and the +1 function.",
keywords = "Church's problem, Games, Monadic logic, Uniformization",
author = "Mark Jenkins and Jo{\"e}l Ouaknine and Alexander Rabinovich and James Worrell",
year = "2011",
doi = "10.4230/LIPIcs.CSL.2011.307",
language = "الإنجليزيّة",
isbn = "9783939897323",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
pages = "307--321",
booktitle = "Computer Science Logic 2011 - 25th International Workshop/20th Annual Conference of the EACSL, CSL 2011",
note = "25th International Workshop on Computer Science Logic, CSL 2011/20th Annual Conference of the European Association for Computer Science Logic, EACSL ; Conference date: 12-09-2011 Through 15-09-2011",
}