Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Alternating automata on infinite trees
Theoretical Computer Science
A fully implicit algorithm for exact state minimization
DAC '94 Proceedings of the 31st annual Design Automation Conference
Testing language containment for &ohgr;-automata using BDDs
Information and Computation
Model checking
Alternating the Temporal Picture for Safety
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Language containment of non-deterministic omega-automata
CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
The Automata Theory Package omega
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Weak Alternating Automata Are Not That Weak
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Boolean Function Representation Using Parallel-Access Diagrams
GLSVLSI '96 Proceedings of the 6th Great Lakes Symposium on VLSI
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Extended Temporal Logic Revisited
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Functional verification of task partitioning for multiprocessor embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
XML schema containment checking based on semi-implicit techniques
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
| Hi-index | 0.00 |
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 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 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.