DeepAI AI Chat
Log In Sign Up

Reactive Synthesis from Extended Bounded Response LTL Specifications

by   Alessandro Cimatti, et al.

Reactive synthesis is a key technique for the design of correct-by-construction systems and has been thoroughly investigated in the last decades. It consists in the synthesis of a controller that reacts to environment's inputs satisfying a given temporal logic specification. Common approaches are based on the explicit construction of automata and on their determinization, which limit their scalability. In this paper, we introduce a new fragment of Linear Temporal Logic, called Extended Bounded Response LTL (), that allows one to combine bounded and universal unbounded temporal operators (thus covering a large set of practical cases), and we show that reactive synthesis from specifications can be reduced to solving a safety game over a deterministic symbolic automaton built directly from the specification. We prove the correctness of the proposed approach and we successfully evaluate it on various benchmarks.


page 1

page 2

page 3

page 4


A Tableau Method for the Realizability and Synthesis of Reactive Safety Specifications

We introduce a tableau decision method for deciding realizability of spe...

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

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

Reactive Control Improvisation

Reactive synthesis has become a widely-used paradigm for automatically b...

Encodings of Bounded Synthesis

The reactive synthesis problem is to compute a system satisfying a given...

Reactive Synthesis for DECLARE via symbolic automata

Given a specification of linear-time temporal logic interpreted over fin...

Expressiveness of Extended Bounded Response LTL

Extended Bounded Response LTL with Past (LTLEBR+P) is a safety fragment ...

Bounded Synthesis of Register Transducers

Reactive synthesis aims at automatic construction of systems from their ...