gaperez64 / acacia-bonsai

A minimal implementation of reactive synthesis via universal co-Buchi automata using antichains
GNU General Public License v3.0
4 stars 3 forks source link

Target TLSF specs #23

Closed gaperez64 closed 8 months ago

gaperez64 commented 1 year ago

Suppose we consider TLSF instead of LTL, that means you can write F_k phi meaning things have to be satisfied within k steps. Can we use the fact that we strengthen semantics in the game to avoid unrolling the F_k into k-nested next? What about G or Until?

This was proposed by A. Cimatti.