Parallel Explicit Model Checking for Generalized Büchi Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Parallel Explicit Model Checking for Generalized Büchi Automata

Alexandre Duret-Lutz
Fabrice Kordon
Denis Poitrenaud
  • Fonction : Auteur
  • PersonId : 968343

Résumé

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.
Fichier non déposé

Dates et versions

hal-01216666 , version 1 (16-10-2015)

Identifiants

Citer

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. pp.613-627, ⟨10.1007/978-3-662-46681-0_56⟩. ⟨hal-01216666⟩
104 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More