# Synthesis from Weighted Specifications with Partial Domains over Finite Words

@article{Filiot2020SynthesisFW,
title={Synthesis from Weighted Specifications with Partial Domains over Finite Words},
author={Emmanuel Filiot and Christof L{\"o}ding and Sarah Winter},
journal={ArXiv},
year={2020},
volume={abs/2103.05550}
}
• Published 9 March 2021
• Computer Science
• ArXiv
In this paper, we investigate the synthesis problem of terminating reactive systems from quantitative specifications. Such systems are modeled as finite transducers whose executions are represented as finite words in (Σi × Σo), where Σi, Σo are finite sets of input and output symbols, respectively. A weighted specification S assigns a rational value (or −∞) to words in (Σi × Σo), and we consider three kinds of objectives for synthesis, namely threshold objectives where the system’s executions…

## Figures and Tables from this paper

Token Games and History-Deterministic Quantitative-Automata
• Computer Science
FoSSaCS
• 2022
A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to their good compositional properties,
History Determinism vs. Good for Gameness in Quantitative Automata
• Computer Science
FSTTCS
• 2021
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.
Between Deterministic and Nondeterministic Quantitative Automata
The possible generalization of such notions from Boolean to quantitative automata is analyzed, and it is suggested that it depends on the following key characteristics of the considered notion N– whether it is syntactic or semantic, and if semantic,Whether it is word-based or language-based.

## References

SHOWING 1-10 OF 44 REFERENCES
Better Quality in Synthesis through Quantitative Objectives
• Computer Science
CAV
• 2009
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.
Safraless Compositional Synthesis
• Computer Science
CAV
• 2006
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.
Quantitative Languages Defined by Functional Automata
• Computer Science, Mathematics
Log. Methods Comput. Sci.
• 2015
This paper investigates functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges and the ratio between rewards and costs, and shows that functionality is decidable for the four measures.
Antichains and compositional algorithms for LTL synthesis
• Computer Science
Formal Methods Syst. Des.
• 2011
This paper presents new monolithic and compositional algorithms based on a reduction of the LTL realizability problem to a game whose winning condition is defined by a universal automaton on infinite words with a k-co-Büchi acceptance condition.
Handbook of Weighted Automata
• Computer Science
• 2009
This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications, and presents a detailed survey of the state of the art and pointers to future research.
Quantitative Assume Guarantee Synthesis
• Computer Science
CAV
• 2017
Researchers have identified the $$\text {GR(1)}$$ fragment of LTL, which supports assume-guarantee reasoning and for which synthesis has an efficient symbolic solution.
Synthesis of Reactive(1) designs
• Computer Science
J. Comput. Syst. Sci.
• 2012
Symbolic LTLf Synthesis
• Computer Science
IJCAI
• 2017
A symbolic framework for LTLf synthesis is proposed, by performing the computation over a representation of the DFA as a boolean formula rather than as an explicit graph, which enables strategy generation by utilizing the mechanism of boolean synthesis.
On delay and regret determinization of max-plus automata
• Computer Science
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2017
It is shown that a WA is determinizable if and only if it is k-delay determinizable for some k, which means deciding the existence of some k is as difficult as the general determinization problem.
Exact and Approximate Determinization of Discounted-Sum Automata
• Computer Science
Log. Methods Comput. Sci.
• 2014
Positive news is provided, showing that every NDA with an integral discount factor is determinizable, and it is proved that the integers characterize exactly the discount factors that guarantee determinizability: for every nonintegral rational discount factor $\lambda$, there is a nondeterminizable $\lambda$-NDA.