CTL* synthesis via LTL synthesis

11/29/2017
by   Roderick Bloem, et al.
0

We reduce synthesis for CTL* properties to synthesis for LTL. In the context of model checking this is impossible - CTL* is more expressive than LTL. Yet, in synthesis we have knowledge of the system structure and we can add new outputs. These outputs can be used to encode witnesses of the satisfaction of CTL* subformulas directly into the system. This way, we construct an LTL formula, over old and new outputs and original inputs, which is realisable if, and only if, the original CTL* formula is realisable. The CTL*-via-LTL synthesis approach preserves the problem complexity, although it might increase the minimal system size. We implemented the reduction, and evaluated the CTL*-via-LTL synthesiser on several examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/15/2023

On Strategies in Synthesis Over Finite Traces

The innovations in reactive synthesis from Linear Temporal Logics over f...
research
04/27/2022

Fairness and promptness in Muller formulas

In this paper we consider two different views of the model checking prob...
research
07/14/2020

Synthesis in Uclid5

We describe an integration of program synthesis into Uclid5, a formal mo...
research
12/14/2010

On the size of data structures used in symbolic model checking

Temporal Logic Model Checking is a verification method in which we descr...
research
04/16/2019

An Efficient Formula Synthesis Method with Past Signal Temporal Logic

In this work, we propose a novel method to find temporal properties that...
research
08/28/2018

Reactive Synthesis: Branching Logics and Parameterized Systems

Reactive synthesis is an automatic way to translate a human intention ex...
research
04/29/2021

A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis

Boolean Skolem function synthesis concerns synthesizing outputs as Boole...

Please sign up or login with your details

Forgot password? Click here to reset