In synthesis, assumptions are constraints on the environment that rule out certain
environment behaviors. A key observation here is that even if we consider systems with LTL …

We formally introduce and solve the synthesis problem for LTL goals in the case of multiple,
even contradicting, assumptions about the environment. Our solution concept is based …

We study best-effort synthesis under environment assumptions specified in LTL, and show
that this problem has exactly the same computational complexity of standard LTL synthesis …

We present a new synthesis framework based on the on-the-fly DFA construction for LTL
over finite traces (LTLf). Extant approaches rely heavily on the construction of the complete …

Qualitative numerical planning is classical planning extended with non-negative real
variables that can be increased or decreased" qualitatively", ie, by positive indeterminate …

This paper establishes a framework based on logic and automata theory in which to model
and automatically verify systems of multiple mobile agents moving in environments with …

In synthesis, assumption are constraints on the environments that rule out certain
environment behaviors. A key observation is that even if we consider system with LTLf goals …

Linear Temporal Logic (LTL) synthesis aims at automatically synthesizing a program that
complies with desired properties expressed in LTL. Unfortunately it has been proved to be …

We address two central notions of fairness in the literature of nondeterministic fully
observable domains. The first, which we call stochastic fairness, is classical, and assumes …

We consider the problem of reaching a propositional goal condition in fully-observable non-
deterministic (FOND) planning under a general class of fairness assumptions that are given …