Language Containment Checking with Nondeterministic BDDs

Bernd Finkbeiner

Checking for language containment between nondeterministic omega-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for language containment checking between two B├╝chi automata. Our algorithm avoids determinization by intersecting the implementation automaton with the complement of the specification automaton as an alternating automaton. We present a fixpoint algorithm for the emptiness check of alternating automata. The main data structure is a nondeterministic extension of binary decision diagrams that canonically represents sets of Boolean functions.

7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001).

(pdf) (bib)