|
Abstract : |
Abstract. Checking for language containment between nondeterministic!-automata is a central task in automata-based hierarchical verication. We present a symbolic procedure for language containment checking between two Buchi automata. Our algorithm avoids determinization by intersecting the implementation automaton with the complement of the speci cation automaton as an alternating automaton. We present a xpoint 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. 1, |
