A Weakness Measure for GR(1) Formulae

05/08/2018
by   Davide G. Cavezza, et al.
0

In spite of the theoretical and algorithmic developments for system synthesis in recent years, little effort has been dedicated to quantifying the quality of the specifications used for synthesis. When dealing with unrealizable specifications, finding the weakest environment assumptions that would ensure realizability is typically a desirable property; in such context the weakness of the assumptions is a major quality parameter. The question of whether one assumption is weaker than another is commonly interpreted using implication or, equivalently, language inclusion. However, this interpretation does not provide any further insight into the weakness of assumptions when implication does not hold. To our knowledge, the only measure that is capable of comparing two formulae in this case is entropy, but even it fails to provide a sufficiently refined notion of weakness in case of GR(1) formulae, a subset of linear temporal logic formulae which is of particular interest in controller synthesis. In this paper we propose a more refined measure of weakness based on the Hausdorff dimension, a concept that captures the notion of size of the omega-language satisfying a linear temporal logic formula. We identify the conditions under which this measure is guaranteed to distinguish between weaker and stronger GR(1) formulae. We evaluate our proposed weakness measure in the context of computing GR(1) assumptions refinements.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2019

Minimal Assumptions Refinement for GR(1) Specifications

Reactive synthesis is concerned with finding a correct-by-construction c...
research
09/11/2020

Synthesis of Run-To-Completion Controllers for Discrete Event Systems

A controller for a Discrete Event System must achieve its goals despite ...
research
04/22/2022

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

While most of the current synthesis algorithms only focus on correctness...
research
04/11/2023

Resolving Ambiguity via Dialogue to Correct Unsynthesizable Controllers for Free-Flying Robots

In situations such as habitat construction, station inspection, or coope...
research
07/25/2021

Neural Circuit Synthesis from Specification Patterns

We train hierarchical Transformers on the task of synthesizing hardware ...
research
04/10/2018

Coverability: Realizability Lower Bounds

We introduce the problem of temporal coverability for realizability and ...

Please sign up or login with your details

Forgot password? Click here to reset