Good-Enough Synthesis

  title={Good-Enough Synthesis},
  author={Shaull Almagor and Orna Kupferman},
  journal={Computer Aided Verification},
  pages={541 - 563}
We introduce and study good-enough synthesis (ge-synthesis) – a variant of synthesis in which the system is required to satisfy a given specification \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\psi $$\end{document} only when it interacts with an environments for which a satisfying interaction exists. Formally… 
Minimization and Canonization of GFG Transition-Based Automata
Their minimization algorithm is based on a sequence of transformations the authors apply to the automaton, on top of which a minimal quotient automaton is defined, and all minimal automata have isomorphic safe components and once they saturate the automata with α-transitions, they get full isomorphism.
Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime
This paper addresses the robust-by-construction synthesis problem by considering the specifications to be expressed by a robust version of Linear Temporal Logic, called robust LTL, and de-veloped two new notions of strategies, which are that of adaptive strategies and strongly adaptive strategies.
Synthesis from Weighted Specifications with Partial Domains over Finite Words
An infinite game framework is developed to solve the corresponding synthesis problems, namely the class of (weighted) critical prefix games and the resulting objectives are not regular in general.
History Determinism vs. Good for Gameness in Quantitative Automata
It is shown that good-for-games automata are central for “global” (classical) synthesis, while “local’ (good-enough) synthesis reduces to deciding whether a nondeterministic automaton is history deterministic.
Continuous Uniformization of Rational Relations and Synthesis of Computable Functions
It is shown that deciding the existence of a computable uniformizer is ExpTime-c and if there is one, it is possible to effectively synthesize a deterministic two-way transducer computing it and generalizes the classical setting of Church synthesis to asynchronous implementations which can arbitrarily delay the production of their output signals.
A Generic Solution to Register-bounded Synthesis with an Application to Discrete Orders
The decidability border to the domain ( N , < ) of natural numbers with linear order is extended, by defining a generic notion of reducibility between data domains, and the decidable of synthesis is shown in the domain of tuples of numbers equipped with the component-wise partial order.
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
It is proved that GFG-PDA recognise more languages than deterministic PDA (DPDA) but not all context-free languages (CFL) and this class is orthogonal to unambiguous CFL.
Synthesizing Computable Functions from Rational Specifications over Infinite Words
It is proved that the synthesis problem of computable functions from rational specifications is undecidable, and an incomplete but sound reduction to some parity game, such that if Eve wins the game, then the rational specification is realizable by a computable function.


Formalizing and Reasoning about Quality
By extending the automata-theoretic approach for LTL to a setting that takes quality into an account, it is able to solve the above problems and show that reasoning about LTL has roughly the same complexity as reasoning about traditional LTL.
Quantitative Assume Guarantee Synthesis
Researchers have identified the \(\text {GR(1)}\) fragment of LTL, which supports assume-guarantee reasoning and for which synthesis has an efficient symbolic solution.
High-Quality Synthesis Against Stochastic Environments
The stochastic setting is introduced, where the goal is to generate a transducer that maximizes the expected quality of a computation, subject to a given distribution of the input signals.
Better Quality in Synthesis through Quantitative Objectives
It is shown how automata with lexicographic mean-payoff conditions can be used to express many interesting quantitative properties for reactive systems, and how quantitative properties to measure the "goodness" of an implementation are used.
Environment Assumptions for Synthesis
The aim is to construct an assumption that constrains only the environment and is as weak as possible and this work presents a two-step algorithm for computing assumptions that operates on the game graph that is used to answer the realizability question.
On the synthesis of a reactive module
An algorithm is presented based on a new procedure for checking the emptiness of Rabin automata on infinite trees in time exponential in the number of pairs, but only polynomial in theNumber of states, which leads to a synthesis algorithm whose complexity is doubleonential in the length of the given specification.
Bounded synthesis
This article introduces the bounded synthesis approach, which makes it possible to traverse this immense search space in a structured manner and demonstrates that bounded synthesis solves many synthesis problems that were previously considered intractable.
Temporal Synthesis for Bounded Systems and Environments
Bounded temporal synthesis is studied, in which bounds on the sizes of the state space of the system and the environment are additional parameters to the synthesis problem, and it is shown that bounding the size of theSystem or both the systemand the environment, turns the synthesized system problem into a search issue, and one cannot expect to do better than brute-force search.
Safraless Compositional Synthesis
The Safraless synthesis algorithm of Kupferman and Vardi is extended so that it handles LTL formulas by translating them to nondeterministic generalized Buchi automata, leading to an exponential improvement in the complexity of the algorithm.
On the complexity of omega -automata
  • S. Safra
  • Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
The author presents a determinisation construction that is simpler and yields a single exponent upper bound for the general case, and can be used to obtain an improved complementation construction for Buchi automata that is essentially optimal.