Skip to main content
Conference ProceedingsOPEN ACCESS

Language containment checking with nondeterministic BDDs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2031 LNCS 24-38
DOI: 10.1007/3-540-45319-9_3
4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Checking for language containment between nondeterministic Ω-automata is a central task in automata-based hierarchical verification. 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 specification automaton as an alternating automaton. We present a fix-point 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. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

Finkbeiner, B. (2001). Language containment checking with nondeterministic BDDs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2031 LNCS, pp. 24–38). Springer Verlag. https://doi.org/10.1007/3-540-45319-9_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free