Coinductive Algorithms for Büchi Automata - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Fundamenta Informaticae Année : 2021

Coinductive Algorithms for Büchi Automata

Résumé

We propose a new algorithm for checking language equivalence of non-deterministic Büchi automata. We start from a construction proposed by Calbrix, Nivat and Podelski, which makes it possible to reduce the problem to that of checking equivalence of automata on finite words. Although this construction generates large and highly non-deterministic automata, we show how to exploit their specific structure and apply state-of-the art techniques based on coinduction to reduce the state-space that has to be explored. Doing so, we obtain algorithms which do not require full determinisation or complementation.
Fichier principal
Vignette du fichier
main.pdf (413.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03364935 , version 1 (05-10-2021)

Identifiants

Citer

Damien Pous, Denis Kuperberg, Laureline Pinault. Coinductive Algorithms for Büchi Automata. Fundamenta Informaticae, 2021, 180 (4), pp.351-373. ⟨10.3233/FI-2021-2046⟩. ⟨hal-03364935⟩
28 Consultations
131 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More