How to Handle Assumptions in Synthesis

@inproceedings{Bloem2014HowTH,
  title={How to Handle Assumptions in Synthesis},
  author={Roderick Bloem and R{\"u}diger Ehlers and Swen Jacobs and Robert K{\"o}nighofer},
  booktitle={SYNT},
  year={2014}
}
The increased interest in reactive synthesis over the last decade has led to many improved solutions but also to many new questions. In this paper, we discuss the question of how to deal with assumptions on environment behavior. We present four goals that we think should be met and review several different possibilities that have been proposed. We argue that each of them falls short in at least one aspect. 

Figures and Tables from this paper

Non-Zero Sum Games for Reactive Synthesis
TLDR
New solution concepts useful for the synthesis of reactive systems that are developed in the context of non-zero sum games played on graphs are summarized.
Assume-Admissible Synthesis
TLDR
This paper introduces a novel rule for synthesis of reactive systems, applicable to systems made of n components which have each their own objectives, based on the notion of admissible strategies, and shows that contrary to the previous proposals, this rule define sets of solutions which are rectangular.
Assume-admissible synthesis
TLDR
This paper introduces a novel rule for synthesis of reactive systems, applicable to systems made of n components which have each their own objectives, and shows that contrary to the previous proposals, it defines sets of solutions which are rectangular.
L O ] 1 7 D ec 2 01 5 Non-Zero Sum Games for Reactive Synthesis ⋆
TLDR
New solution concepts useful for the synthesis of reactive systems that are developed in the context of non-zero sum games played on graphs are summarized.
Synthesis under Assumptions
We consider the following elusive question which has generated a lot of ad hoc research: In synthesis/planning, which constraints on traces are environment assumptions? We propose to view assumptions
Cooperative Reactive Synthesis
TLDR
A modern approach to engineering correct-by-construction systems is to synthesize them automatically from formal specifications, but experience shows that synthesized systems tend to satisfy their specifications by actively working towards the violation of the assumptions rather than satisfying assumptions and guarantees together.
Environmentally-friendly GR(1) Synthesis
TLDR
This work gives an algorithm for solving GR(1) synthesis that produces non-conflicting strategies, and ensures that, in every environment that satisfies its assumptions on its own, traces of the resulting implementation satisfy both the assumptions and the guarantees.
Opportunistic Synthesis in Reactive Games under Information Asymmetry
  • A. Kulkarni, Jie Fu
  • Computer Science
    2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2019
TLDR
The core idea of reactive synthesis is to model the interaction between a controlled agent and its dynamic and uncontrollable environment as a two-player turn-based zero-sum game.
On the relation between reactive synthesis and supervisory control of non-terminating processes
TLDR
A formal comparison is provided which allows to identify conditions under which one can solve one synthesis problem using methods from the other one and to derive formal problem statements and a characterisation of their solutions in terms of ω -languages.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 50 REFERENCES
Automatic Compositional Synthesis of Distributed Systems
TLDR
It is shown that for specifications that admit dominant strategies, distributed systems can be synthesized compositionally, considering one process at a time, which has dramatically better complexity and is uniformly applicable to all system architectures.
Revisiting Synthesis of GR(1) Specifications
TLDR
A fundamental flaw is exposed in the initial processing of specifications in Piterman et al.'s paper and it is shown that it can be easily checked whether specifications belong to the sound and complete class by using the same synthesis techniques.
Synthesizing Robust Systems with RATSY
TLDR
An extension of the requirementsanalysis and synthesis tool RATSY that is able to synthesize robust systems from GR(1) specifica-tions, i.e., system in which a finite number of safety assumption violations is guaranteed to induce only aflniteNumber of safety guarantee violations.
Synthesizing robust systems
TLDR
This article defines two robustness notions, combine them, and shows how to enforce them in synthesis of robust reactive systems from temporal specifications, and presents an implementation of a special case of robustness.
Controller Synthesis for Probabilistic Systems
TLDR
A model with probabilism and nondeterminism where the nondeterministic choices in some states are assumed to be controllable, while the others are under the control of an unpredictable environment is considered.
Resilience to intermittent assumption violations in reactive synthesis
TLDR
The framework for achieving reactive systems that are robust against intermittent violations of their environment assumptions is presented, which builds on generalized reactivity(1) synthesis, a synthesis approach that is well-known to be scalable enough for many practical applications.
Synthesizing nonanomalous event-based controllers for liveness goals
We present SGR(1), a novel synthesis technique and methodological guidelines for automatically constructing event-based behavior models. Our approach works for an expressive subset of liveness
Synthesizing Efficient Controllers
TLDR
This paper provides a specification framework for controllers in probabilistic environments and shows how to synthesize implementations from them by reduction to Markov Decision Processes with a novel objective function.
Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis
TLDR
This approach inherits the good algorithmic properties of generalized reactivity(1) synthesis but extends it to also allow co-Buchi-type assumptions and guarantees, which makes it usable for the synthesis of robust systems.
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
We have shown that it is possible to automatically synthesize the synchronization skeleton of a concurrent program from a Temporal Logic specification. We believe that this approach may in the long
...
1
2
3
4
5
...