Variations on Parallel Explicit Emptiness Checks for Generalized Büchi Automata - Archive ouverte HAL Access content directly
Journal Articles International Journal on Software Tools for Technology Transfer Year : 2017

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.
Fichier principal
Vignette du fichier
2016-sttt.pdf (555.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01310101 , version 1 (01-05-2016)

Identifiers

Cite

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, 2017, 19 (6), pp.653-673. ⟨10.1007/s10009-016-0422-5⟩. ⟨hal-01310101⟩
243 View
265 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More