• Citer

Fixed point guided abstraction refinement for alternating automata

par Ganty, Pierre ;Maquet, Nicolas ;Raskin, Jean-François
Référence Theoretical computer science, 411, 38-39, page (3444-3459)
Publication Publié, 2010-08

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

In this paper, we develop and evaluate two new algorithms for checking emptiness of alternating automata. These algorithms build on previous works. First, they rely on antichains to efficiently manipulate the state-spaces underlying the analysis of alternating automata. Second, they are abstract algorithms with built-in refinement operators based on techniques that exploit information computed by abstract fixed points (and not counter-examples as it is usually the case). The efficiency of our new algorithms is illustrated by experimental results. © 2010 Elsevier B.V. All rights reserved.