Coverability: Realizability Lower Bounds

04/10/2018
by   Krishnendu Chatterjee, et al.
0

We introduce the problem of temporal coverability for realizability and synthesis. Namely, given a language of words that must be covered by a produced system, how to automatically produce such a system. We consider the case of coverability with no further specifications, where we have to show that the nondeterminism of the produced system is sufficient to produce all the words required in the output language. We show a counting argument on a deterministic automaton representing the language to be covered that allows to produce such a system. We then turn to the case of coverability with additional specification and give a precondition for the existence of a system that produces all required words and at the same time produces only computations satisfying the additional correctness criterion. We combine our counting argument on the deterministic automaton for the language to be covered with a ranking on the deterministic Büchi automaton for the correctness criterion. One of the major issues with practical realizability is the interaction between environment assumptions and system guarantees. In many cases, synthesis produces systems that are vacuous and concentrate on forcing the environment to falsify its assumptions instead of fulfilling their guarantees. Coverability offers an alternative approach to tackle this problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2023

LTLf Synthesis Under Environment Specifications for Reachability and Safety Properties

In this paper, we study LTLf synthesis under environment specifications ...
research
03/09/2021

Synthesis from Weighted Specifications with Partial Domains over Finite Words

In this paper, we investigate the synthesis problem of terminating react...
research
03/23/2018

A Curry-Howard Approach to Church's Synthesis

Church's synthesis problem asks whether there exists a finite-state stre...
research
02/14/2019

Environmentally-friendly GR(1) Synthesis

Many problems in reactive synthesis are stated using two formulas ---an ...
research
05/08/2018

A Weakness Measure for GR(1) Formulae

In spite of the theoretical and algorithmic developments for system synt...
research
10/31/2019

Parameterized Synthesis for Fragments of First-Order Logic over Data Words

We study the synthesis problem for systems with a parameterized number o...
research
09/17/2019

Specification and Optimal Reactive Synthesis of Run-time Enforcement Shields

A system with sporadic errors (SSE) is a controller which produces high ...

Please sign up or login with your details

Forgot password? Click here to reset