Sciweavers

TACAS
2001
Springer
92views Algorithms» more  TACAS 2001»
13 years 9 months ago
Language Containment Checking with Nondeterministic BDDs
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...
Bernd Finkbeiner