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

06/03/2022
by   Montserrat Hermo, et al.
0

We introduce a tableau decision method for deciding realizability of specifications expressed in a safety fragment of LTL that includes bounded future temporal operators. Tableau decision procedures for temporal and modal logics have been thoroughly studied for satisfiability and for translating temporal formulae into equivalent Büchi automata, and also for model checking, where a specification and system are provided. However, to the best of our knowledge no tableau method has been studied for the reactive synthesis problem. Reactive synthesis starts from a specification where propositional variables are split into those controlled by the environment and those controlled by the system, and consists on automatically producing a system that guarantees the specification for all environments. Realizability is the decision problem of whether there is one such system. In this paper we present a method to decide realizability of safety specifications, from which we can also extract (i.e. synthesize) a correct system (in case the specification is realizable). Our method can easily be extended to handle richer domains (integers, etc) and bounds in the temporal operators in ways that automata approaches for synthesis cannot.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/12/2020

Reactive Synthesis from Extended Bounded Response LTL Specifications

Reactive synthesis is a key technique for the design of correct-by-const...
research
10/19/2022

Synthesizing Reactive Test Environments for Autonomous Systems: Testing Reach-Avoid Specifications with Multi-Commodity Flows

We study automated test generation for verifying discrete decision-makin...
research
04/14/2022

On the Expressive Power of the Normal Form for Branching-Time Temporal Logics

With the emerging applications that involve complex distributed systems ...
research
05/26/2021

TEMPEST – Synthesis Tool for Reactive Systems and Shields in Probabilistic Environments

We present Tempest, a synthesis tool to automatically create correct-by-...
research
03/09/2022

Computing unsatisfiable cores for LTLf specifications

Linear-time temporal logic on finite traces (LTLf) is rapidly becoming a...
research
11/10/2019

Synthesis of coordination programs from linear temporal logic

This paper presents a method for synthesizing a reactive program which c...
research
07/03/2020

Supervisory Controller Synthesis for Non-terminating Processes is an Obliging Game

We present a new algorithm to solve the supervisory control problem over...

Please sign up or login with your details

Forgot password? Click here to reset