3 citations · 4 across the 4 of their papers we have counts for
4 papers · 1 filter
Good-Enough Synthesis
Shaull Almagor, Orna Kupferman
In the classical synthesis problem, we are given an LTL formula ψover sets of input and output signals, and we synthesize a system T that realizes ψ: with every input sequences x,…
Canonicity in GFG and Transition-Based Automata
Bader Abu Radi, Orna Kupferman
Minimization of deterministic automata on finite words results in a {\em canonical\/} automaton. For deterministic automata on infinite words, no canonical minimal automaton exists…
How Deterministic are Good-For-Games Automata?
Udi Boker, Orna Kupferman, Michał Skrzypczak
In GFG automata, it is possible to resolve nondeterminism in a way that only depends on the past and still accepts all the words in the language. The motivation for GFG automata co…
Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis
Shaull Almagor, Orna Kupferman, Yaron Velner
In Boolean synthesis, we are given an LTL specification, and the goal is to construct a transducer that realizes it against an adversarial environment. Often, a specification conta…