The Extended HOA Format for Synthesis

12/12/2019
by   Guillermo A. Perez, et al.
0

We propose a small extension to the Hanoi Omega-Automata format to define reactive-synthesis problems. Namely, we add a "controllable-AP" header item specifying the subset of atomic propositions which is controllable. We describe the semantics of the new format and propose an output format for synthesized strategies. Finally, we also comment on tool support meant to encourage fast adoption of the extended Hanoi Omega-Automata format for synthesis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/07/2023

The Temporal Logic Synthesis Format TLSF v1.2

We present an extension of the Temporal Logic Synthesis Format (TLSF). T...
research
07/06/2021

Alethe: Towards a Generic SMT Proof Format (extended abstract)

The first iteration of the proof format used by the SMT solver veriT was...
research
06/20/2022

From Spot 2.0 to Spot 2.10: What's New?

Spot is a C ++ 17 library for LTL and ω-automata manipulation, with comm...
research
03/29/2019

Practical Synthesis of Reactive Systems from LTL Specifications via Parity Games

The synthesis - the automatic construction - of reactive systems from li...
research
09/08/2023

Representation Synthesis by Probabilistic Many-Valued Logic Operation in Self-Supervised Learning

Self-supervised learning (SSL) using mixed images has been studied to le...
research
05/01/2018

Exploring the Accuracy of MIRT Scale Linking Procedures for Mixed-format Tests

This study investigates the accuracy of Stocking-Lord scale linking proc...
research
01/06/2023

A double-elimination format for a 48-team FIFA World Cup

I present a double-elimination format for the 48-team FIFA World Cup tha...

Please sign up or login with your details

Forgot password? Click here to reset