×

Language containment checking with nondeterministic BDDs. (English) Zbl 0978.68093

Margaria, Tiziana (ed.) et al., Tools and algorithms for the construction and analysis of systems. 7th international conference, TACAS 2001, held as part of the joint European conferences on theory and practice of software, ETAPS 2001, Genova, Italy, April 2-6, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2031, 24-38 (2001).
Summary: 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.
For the entire collection see [Zbl 0960.00058].

MSC:

68Q60 Specification and verification (program logics, model checking, etc.)

Software:

MOCHA
PDFBibTeX XMLCite
Full Text: Link