We define the problem of learning a transducer ${S}$ from a target language $U$ containing possibly conflicting transducers, using membership queries and conjecture queries. The requirement is that the language of ${S}$ be a subset of $U$. We argue that this is a natural question in many situations in hardware and software verification. We devise a learning algorithm for this problem and show that its time and query complexity is polynomial with respect to the rank of the target language, its incompatibility measure, and the maximal length of a given counterexample. We report on experiments conducted with a prototype implementation.

中文翻译：

---

Safety Synthesis Sans 规范

我们使用成员查询和猜想查询来定义从包含可能冲突的转换器的目标语言 $U$ 中学习转换器 ${S}$ 的问题。要求是 ${S}$ 的语言是 $U$ 的子集。我们认为，在硬件和软件验证的许多情况下，这是一个自然的问题。我们为这个问题设计了一个学习算法，并表明它的时间和查询复杂度是关于目标语言的等级、不兼容度量和给定反例的最大长度的多项式。我们报告了使用原型实现进行的实验。