Skip to Main content Skip to Navigation
Conference papers

Emptiness Check of Powerset Buchi Automata

Souheib Baarir Alexandre Duret-Lutz 1
1 MoVe - Modélisation et Vérification
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We introduce two emptiness checks for buchi automata whose states represent sets that may include each other. The first is equivalent to a traditional emptiness check but uses inclusion tests to direct the on-the-fly construction of the automaton. The second is impressively faster but may return false negatives. We illustrate and benchmark the improvement on a symmetry-based reduction.
Document type :
Conference papers
Complete list of metadata
Contributor : Lip6 Publications Connect in order to contact the contributor
Submitted on : Thursday, April 21, 2016 - 5:37:15 PM
Last modification on : Friday, January 8, 2021 - 5:38:07 PM

Links full text



Souheib Baarir, Alexandre Duret-Lutz. Emptiness Check of Powerset Buchi Automata. 7th International Conference on Application of Concurrency to System Design (ACSD'07), Jul 2007, Bratislava, Slovakia. pp.41-50, ⟨10.1109/ACSD.2007.49⟩. ⟨hal-01305778⟩



Record views