Search Results for author:
Found 7 papers, 0 papers with code
LTLf Best-Effort Synthesis in Nondeterministic Planning Domains
We study best-effort strategies (aka plans) in fully observable nondeterministic domains (FOND) for goals expressed in Linear Temporal Logic on Finite Traces (LTLf).
LTLf Synthesis Under Environment Specifications for Reachability and Safety Properties
In this paper, we study LTLf synthesis under environment specifications for arbitrary reachability and safety properties.
Symbolic LTLf Best-Effort Synthesis
We consider an agent acting to fulfil tasks in a nondeterministic environment.
Mimicking Behaviors in Separated Domains
Devising a strategy to make a system mimicking behaviors from another system is a problem that naturally arises in many areas of Computer Science.
LTLf Synthesis with Fairness and Stability Assumptions
A key observation here is that even if we consider systems with LTLf goals on finite traces, environment assumptions need to be expressed over infinite traces, since accomplishing the agent goals may require an unbounded number of environment action.
Symbolic LTLf Synthesis
LTLf synthesis is the process of finding a strategy that satisfies a linear temporal specification over finite traces.
