Variations on Parallel Explicit Emptiness Checks for Generalized Büchi Automata

Abstract : We present new parallel explicit emptiness checks for LTL model checking. Unlike existing parallel emptiness checks, these are based on a Strongly Connected Component (SCC) enumeration, support generalized Büchi acceptance, and require no synchronization points nor recomputing procedures. A salient feature of our algorithms is the use of a global union-find data structure in which multiple threads share structural information about the automaton checked. Besides these basic algorithms, we present one architectural variant isolating threads that write to the union-find, and one extension that decomposes the automaton based on the strength of its SCCs to use more optimized emptiness checks. The results from an extensive experimentation of our algorithms and their variations show encouraging performances, especially when the decomposition technique is used.
Type de document :
Article dans une revue
International Journal on Software Tools for Technology Transfer, Springer Verlag, 2016, <10.1007/s10009-016-0422-5>
Liste complète des métadonnées


http://hal.upmc.fr/hal-01310101
Contributeur : Fabrice Kordon <>
Soumis le : dimanche 1 mai 2016 - 20:19:31
Dernière modification le : mardi 11 octobre 2016 - 15:01:06
Document(s) archivé(s) le : mardi 24 mai 2016 - 16:25:32

Fichier

2016-sttt.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Etienne Renault, Alexandre Duret-Lutz, Fabrice Kordon, Denis Poitrenaud. Variations on Parallel Explicit Emptiness Checks for Generalized Büchi Automata. International Journal on Software Tools for Technology Transfer, Springer Verlag, 2016, <10.1007/s10009-016-0422-5>. <hal-01310101>

Partager

Métriques

Consultations de
la notice

193

Téléchargements du document

44