Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas

Cited literature [36 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01310101
Contributor : Fabrice Kordon <>
Submitted on : Sunday, May 1, 2016 - 8:19:31 PM
Last modification on : Friday, March 27, 2020 - 2:53:35 AM
Document(s) archivé(s) le : Tuesday, May 24, 2016 - 4:25:32 PM

File

2016-sttt.pdf
Files produced by the author(s)

Identifiers

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

Share

Metrics

Record views

495

Files downloads

753