Explorable automata - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

Explorable automata

Résumé

We define the class of explorable automata on finite or infinite words. This is a generalization of Good-For-Games (GFG) automata, where this time non-deterministic choices can be resolved by building finitely many simultaneous runs instead of just one. We show that recognizing GFG automata among explorable ones is in PTime, thereby giving a strong link between the two notions. We then show that recognizing explorable automata is ExpTime-complete, in the case of finite words or Büchi automata. Additionally, we define the notion of ω-explorable automata on infinite words, where countably many runs can be used to resolve the non-deterministic choices. We show that all reachability automata are ω-explorable, but this is not the case for safety ones. We finally show ExpTime-completeness for ω-explorability of automata on infinite words, covering the safety and co-Büchi acceptance conditions.
Fichier principal
Vignette du fichier
Explorable Automata.pdf (764.93 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03669659 , version 1 (16-05-2022)
hal-03669659 , version 2 (08-11-2022)

Identifiants

Citer

Emile Hazard, Denis Kuperberg. Explorable automata. 2022. ⟨hal-03669659v1⟩
78 Consultations
90 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More