Parallel Explicit Model Checking for Generalized Büchi Automata

Abstract : We present new parallel emptiness checks for LTL model checking. Unlike existing parallel emptiness checks, these are based on an SCC enumeration, support generalized Büchi acceptance, and require no synchronization points nor repair 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 being checked. Our prototype implementation has encouraging performances: the new emptiness checks have better speedup than existing algorithms in half of our experiments.
Type de document :
Communication dans un congrès
21th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2015, Apr 2015, London, United Kingdom. Springer, 9035, pp.613-627, Lecture Notes in Computer Science. <10.1007/978-3-662-46681-0_56>
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01216666
Contributeur : Lip6 Publications <>
Soumis le : vendredi 16 octobre 2015 - 16:06:17
Dernière modification le : lundi 29 mai 2017 - 14:25:44

Identifiants

Collections

Citation

Etienne Renault, Alexandre Duret-Lutz, Fabrice Kordon, Denis Poitrenaud. Parallel Explicit Model Checking for Generalized Büchi Automata. 21th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2015, Apr 2015, London, United Kingdom. Springer, 9035, pp.613-627, Lecture Notes in Computer Science. <10.1007/978-3-662-46681-0_56>. <hal-01216666>

Partager

Métriques

Consultations de la notice

78