Skip to Main content Skip to Navigation

Emptiness Check of Powerset Büchi Automata using Inclusion Tests

Souheib Baarir 1 Alexandre Duret-Lutz 1 
1 MoVe - Modélisation et Vérification
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : A possible attack on the state explosion of the automata-theoretic approach to model-checking is to build an automaton B whose states represent sets of states of the original automaton A to check for emptiness. This paper introduces two emptiness checks for Büchi automata whose states represent sets that may include each other. The first check on B is equivalent to a traditional emptiness check on A but uses inclusion tests to direct and further reduce the on-the-fly construction of B. The second check is impressively faster but may return false negatives. We illustrate and benchmark both using a symmetry-based reduction.
Document type :
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Lip6 Publications Connect in order to contact the contributor
Submitted on : Friday, April 17, 2020 - 11:57:00 AM
Last modification on : Sunday, June 26, 2022 - 9:55:32 AM


Files produced by the author(s)


  • HAL Id : hal-02545696, version 1


Souheib Baarir, Alexandre Duret-Lutz. Emptiness Check of Powerset Büchi Automata using Inclusion Tests. [Technical Report] lip6.2006.003, LIP6. 2006. ⟨hal-02545696⟩



Record views


Files downloads