LTLf Synthesis Under Environment Specifications for Reachability and Safety Properties

08/29/2023
by   Benjamin Aminof, et al.
0

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 and environment specifications, providing a complete landscape of synthesis algorithms. For each case, we devise a specific algorithm (optimal wrt complexity of the problem) and prove its correctness. The algorithms combine common building blocks in different ways. While some cases are already studied in literature others are studied here for the first time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/13/2018

Reactive Control Improvisation

Reactive synthesis has become a widely-used paradigm for automatically b...
research
04/10/2018

Coverability: Realizability Lower Bounds

We introduce the problem of temporal coverability for realizability and ...
research
07/18/2018

Planning and Synthesis Under Assumptions

In Reasoning about Action and Planning, one synthesizes the agent plan b...
research
07/13/2020

Complexity of Verification and Synthesis of Threshold Automata

Threshold automata are a formalism for modeling and analyzing fault-tole...
research
09/17/2021

Adapting to the Behavior of Environments with Bounded Memory

We study the problem of synthesizing implementations from temporal logic...
research
02/07/2023

Act for Your Duties but Maintain Your Rights

Most of the synthesis literature has focused on studying how to synthesi...
research
06/21/2021

Automatic Synthesis of Experiment Designs from Probabilistic Environment Specifications

This paper presents an extension to the probabilistic programming langua...

Please sign up or login with your details

Forgot password? Click here to reset