Skip to Main content Skip to Navigation
Conference papers

On-the-Fly Emptiness Checks for Generalized Büchi Automata

Abstract : Emptiness check is a key operation in the automata-theoretic approach to LTL verification. However, it is usually done on Büchi automata with a single acceptance condition. We review existing on-the-fly emptiness-check algorithms for generalized Büchi automata (i.e., with multiple acceptance conditions) and show how they compete favorably with emptiness-checks for degeneralized automata, especially in presence of weak fairness assumptions. We also introduce a new emptiness-check algorithm, some heuristics to improve existing checks, and propose algorithms to compute accepting runs in the case of multiple acceptance conditions.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01487942
Contributor : Lip6 Publications <>
Submitted on : Monday, March 13, 2017 - 11:39:09 AM
Last modification on : Thursday, March 21, 2019 - 1:08:01 PM

Links full text

Identifiers

Citation

Jean-Michel Couvreur, Alexandre Duret-Lutz, Denis Poitrenaud. On-the-Fly Emptiness Checks for Generalized Büchi Automata. 12th International SPIN Workshop on Model Checking of Software, Aug 2005, San Francisco, United States. pp.169-184, ⟨10.1007/11537328_15⟩. ⟨hal-01487942⟩

Share

Metrics

Record views

109