Better Quality in Synthesis through Quantitative Objectives

  title={Better Quality in Synthesis through Quantitative Objectives},
  author={Roderick Bloem and Krishnendu Chatterjee and Thomas A. Henzinger and Barbara Jobstmann},
Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another. For example, if a specification asks that every request is followed by a response, one may prefer an implementation that generates responses quickly but does not generate unnecessary responses. We use quantitative properties to measure the "goodness" of an implementation. Using games with corresponding quantitative objectives… 
Synthesizing Systems with Optimal Average-Case Behavior for Ratio Objectives
This paper shows how to automatically construct a system that satisfies a given logical specification and has an optimal average behavior with respect to a specification with ratio costs and finds an optimal strategy for these using a fractional linear program.
Quantitative Synthesis for Concurrent Programs
An algorithmic method and an implementation that works efficiently for concurrent programs and performance models of practical interest are presented that synthesize finite-state concurrent programs that exhibit different programming patterns, for several performance models representing different architectures.
Measuring and Synthesizing Systems in Probabilistic Environments
This work has implemented the approach and the underlying algorithms in a tool that takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists.
Synthesis from incompatible specifications
This work introduces a flexible framework for quantifying how "well" an implementation satisfies a specification, and provides an algorithmic solution for the following quantitative synthesis question: given two (or more) behavioral requirements specified by possibly incompatible finite-state machines, and an error model, find the finite- state implementation that minimizes the maximal simulation distance to the given requirements.
DCSynth: Guided Reactive Synthesis with Soft Requirements
The proposed technique for guided controller synthesis from regular requirements which are specified using an interval temporal logic QDDC is found to be well suited for guided synthesis due to its superiority in dealing with both qualitative and quantitative specifications.
From Boolean to quantitative synthesis
  • Pavol Cerný, T. Henzinger
  • Computer Science
    2011 Proceedings of the Ninth ACM International Conference on Embedded Software (EMSOFT)
  • 2011
It is argued that quantitative objectives are needed in partial-program synthesis in order to produce higher-quality programs, while enabling simpler specifications.
Synthesizing efficient systems in probabilistic environments
A formalism, algorithms and tools to synthesise reactive systems that behave efficiently, i.e., which achieve an optimal trade-off between a given cost and reward model are presented and it is proved that such systems exist and are computable.
Reactive synthesis with maximum realizability of linear temporal logic specifications
This work introduces a value function that, by exploiting the LTL semantics, quantifies the level of violation of properties and proposes a novel maximum satisfiability encoding of the search for an optimal implementation.
Recent Challenges and Ideas in Temporal Synthesis
The synthesis problem is introduced, algorithms for solving it, and recent promising ideas in making temporal-synthesis useful in practice are introduced.
Bridging boolean and quantitative synthesis using smoothed proof search
A new technique for parameter synthesis under boolean and quantitative objectives that reduces the task to a sequence of unconstrained smooth optimization problems that are then solved numerically.


Compositional Quantitative Reasoning
It is shown that the classical Boolean rules for compositional reasoning have quantitative counterparts in the authors' setting, and a class of linear cost functions are considered, which give rise to an instance of the framework where all operations are computable in polynomial time.
Verifying Quantitative Properties Using Bound Functions
Along with the linear-time, automaton-based view of quantitative verification, a corresponding branching-time view based on a quantitative-bound μ-calculus is presented, and the relationship, expressive power, and complexity of both views are studied.
On Omega-Languages Defined by Mean-Payoff Conditions
This paper proposes the class of multi-threshold mean-payoff languages using acceptance conditions that are Boolean combinations of inequalities comparing the minimal or maximal accumulation point along some coordinate with a constant threshold.
How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems
This paper argues that current formal specification methods cannot be used to specify long-run average properties of probabilistic systems, and proposes simple extensions of temporal logics based on experiments, and model-checking algorithms for the verification of properties of finite-state timed probabilism systems in which both Probabilistic and nondeterministic choice are present.
Resource Interfaces
A formalism for specifying component interfaces that expose component requirements on limited resources permits an algorithmic check if two or more components, when put together, exceed the available resources and can be used to compute the quantity of resources necessary for satisfying the requirements of a collection of components.
Mean-payoff parity games
It is shown that optimal strategies exist in mean-payoff parity games, but they may require infinite memory.
Quantitative languages
A notion of quantitative simulation that is decidable and implies language inclusion is introduced, and it is shown that most classes of weighted automata cannot be determinized.
Lattice Automata
An automata-theoretic framework for reasoning about multi-valued objects, and it is shown that while determinization of lattice automata involves a blow up that depends on the size of the lattice, such ablow up can be avoided when complementation is easier than determinization.
Games Where You Can Play Optimally Without Any Memory
This paper presents a simple necessary and sufficient condition on payoff mapping guaranteeing the existence of optimal positional strategies for both players and shows the following remarkable property of payoff mappings: if both players have optimal positional Strategies when playing solitary one-player games then also they have optimal Positional strategies for two- player games.
Games with secure equilibria