12 citations · 21 across the 10 of their papers we have counts for
11 papers
FONDANT: Strong and Best-Effort Planning via Antichains
Benjamin Aminof, Tuan Khai Nguyen, Sasha Rubin
A classical solution concept in fully observable nondeterministic (FOND) planning, is the strong policy (aka winning strategy in the closely related area of reactive synthesis), i.…
LTLf+ and PPLTL+: Extending LTLf and PPLTL to Infinite Traces
Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin +1
We introduce LTLf+ and PPLTL+, two logics to express properties of infinite traces, that are based on the linear-time temporal logics LTLf and PPLTL on finite traces. LTLf+/PPLTL+…
Parameterized Model-checking of Discrete-Timed Networks and Symmetric-Broadcast Systems
Benjamin Aminof, Sasha Rubin, Francesco Spegni +1
We study the complexity of the model-checking problem for parameterized discrete-timed systems with arbitrarily many anonymous and identical processes, with and without a distingui…
LTLf Synthesis Under Environment Specifications for Reachability and Safety Properties
Benjamin Aminof, Giuseppe De Giacomo, Antonio Di Stasio +3
In this paper, we study LTLf synthesis under environment specifications for arbitrary reachability and safety properties. We consider both kinds of properties for both agent tasks…
Stochastic Fairness and Language-Theoretic Fairness in Planning on Nondeterministic Domains
Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin
We address two central notions of fairness in the literature of planning on nondeterministic fully observable domains. The first, which we call stochastic fairness, is classical, a…
Planning and Synthesis Under Assumptions
Benjamin Aminof, Giuseppe De Giacomo, Aniello Murano +1
In Reasoning about Action and Planning, one synthesizes the agent plan by taking advantage of the assumption on how the environment works (that is, one exploits the environment's e…