Eventually Safe Languages - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Eventually Safe Languages

Résumé

Good-for-Games (GFG) automata constitute a sound alternative to determinism as a way to model specifications in the Church synthesis problem. Typically, inputs for the synthesis problem are in the form of LTL formulas. However, the only known examples where GFG automata present an exponential gap in succinctness compared to deter-ministic ones are not LTL-definable. We show that GFG automata still enjoy exponential succinctness for LTL-definable languages. We introduce a class of properties called "eventually safe" together with a specification language E νTL for this class. We finally give an algorithm to produce a Good-for-Games automaton from any E νTL formula, thereby allowing synthesis for eventually safe properties.
Fichier principal
Vignette du fichier
GFGLTL.pdf (737.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02348828 , version 1 (05-11-2019)

Identifiants

Citer

Simon Iosti, Denis Kuperberg. Eventually Safe Languages. Developments in Language Theory, Aug 2019, Varsovie, Poland. pp.192-205, ⟨10.1007/978-3-030-24886-4_14⟩. ⟨hal-02348828⟩
76 Consultations
117 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More