We introduce and study good-enough synthesis (ge-synthesis)–a variant of synthesis in
which the system is required to satisfy a given specification ψ only when it interacts with an …

In Rational Synthesis, we consider a multi-agent system in which some of the agents are
controllable and some are not. All agents have objectives, and the goal is to synthesize …

Synthesis is the automated construction of a system from its specification. In many cases, we
want to maintain the privacy of the system and the environment, thus limit the information …

Time-triggered (TT) switched networks are a deterministic communication infrastructure
used by real-time distributed embedded systems. These networks rely on the notion of …

Weighted automata are widely researched, but with a variety of different semantics, which
mostly fit into either the “quantitative view” or the “algebraic view”. We argue that the two …

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 contains …

Traditional computer science is Boolean: a Turing machine accepts or rejects its input, and
logic assertions are true or false. A primary use of logic in computer science has been the …

In assume-guarantee synthesis, we are given a specification ⟨ A, G ⟩, describing an
assumption on the environment and a guarantee for the system, and we construct a system …

We show that under some general conditions the finite memory determinacy of a class of two-
player win/lose games played on finite graphs implies the existence of a Nash equilibrium …

In the classical synthesis problem, we are given an LTL formula psi over sets of input and
output signals, and we synthesize a transducer that realizes psi. One weakness of …