DeepAI AI Chat
Log In Sign Up

Maximum Realizability for Linear Temporal Logic Specifications

by   Rayna Dimitrova, et al.

Automatic synthesis from linear temporal logic (LTL) specifications is widely used in robotic motion planning, control of autonomous systems, and load distribution in power networks. A common specification pattern in such applications consists of an LTL formula describing the requirements on the behaviour of the system, together with a set of additional desirable properties. We study the synthesis problem in settings where the overall specification is unrealizable, more precisely, when some of the desirable properties have to be (temporarily) violated in order to satisfy the system's objective. We provide a quantitative semantics of sets of safety specifications, and use it to formalize the "best-effort" satisfaction of such soft specifications while satisfying the hard LTL specification. We propose an algorithm for synthesizing implementations that are optimal with respect to this quantitative semantics. Our method builds upon the idea of the bounded synthesis approach, and we develop a MaxSAT encoding which allows for maximizing the quantitative satisfaction of the safety specifications. We evaluate our algorithm on scenarios from robotics and power distribution networks.


page 1

page 2

page 3

page 4


Taming Large Bounds in Synthesis from Bounded-Liveness Specifications (Full Version)

Automatic synthesis from temporal logic specifications is an attractive ...

Neural Network-based Control for Multi-Agent Systems from Spatio-Temporal Specifications

We propose a framework for solving control synthesis problems for multi-...

Specification sketching for Linear Temporal Logic

Virtually all verification and synthesis techniques assume that the form...

Promptness and Bounded Fairness in Concurrent and Parameterized Systems

We investigate the satisfaction of specifications in Prompt Linear Tempo...

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime

While most of the current synthesis algorithms only focus on correctness...

Executable Interval Temporal Logic Specifications

In this paper the reversibility of executable Interval Temporal Logic (I...

What to Do When You Can't Do It All: Temporal Logic Planning with Soft Temporal Logic Constraints

In this paper, we consider a temporal logic planning problem in which th...