Language containment checking with nondeterministic BDDs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2031 LNCS, Issue , 2001, Pages 24-38

  Finkbeiner, Bernd ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; ALGORITHMS; AUTOMATA THEORY;

ALTERNATING AUTOMATA; BUCHI AUTOMATA; DETERMINIZATION; EMPTINESS CHECKS; FIX-POINT ALGORITHMS; HIERARCHICAL VERIFICATION; X-POINT;

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS;

EID: 84903208231     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45319-9_3     Document Type: Conference Paper

References (15)

1. R. Alur, T. Henzinger, F. Mang, S. Qadeer, S. Rajamani, and S. Tasiran. MOCHA: modularity in model checking. In A. Hu and M. Vardi, editors, CAV 98: Computer-aided Verification, Lecture Notes in Computer Science 1427, pages 521-525. Springer-Verlag, 1998.
2. V. Bertacco and M. Damiani. Boolean function representation using paral- lel access diagrams. In The Sixth Great Lakes Symposium on VLSI. IEEE, 1996.
3. N. Buhrke, O. Matz, S. Ulbrand, and J. Vöge. The automata theory package omega. In WIA '97, vol. 1436 of LNCS. Springer-Verlag, 1997.
4. R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
5. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
6. O. Kupferman and M. Vardi. Weak alternating automata are not that weak. In 5th Israeli Symposium on Theory of Computing and Systems, pages 147-158. IEEE Computer Society Press, 1997.
7. T. Kam, T. Villa, R. Brayton, and A. Sangiovanni-Vincentelli. A fully implicit algorithm for exact state minimization. In 31st ACM/IEEE Design Automation Conference, pages 684-690. ACM, 1994.
8. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54(2-3):267-276, October 1987.
9. Z. Manna and H.B. Sipma. Alternating the temporal picture for safety. In U. Montanari, J.D. Rolim, and E. Welzl, editors, Proc. 27th Intl. Col-loq. Aut. Lang. Prog., vol. 1853, pages 429-450, Geneva, Switzerland, July 2000. Springer-Verlag.
10. S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symp. Found, of Comp. Sci, pages 319-327, 1988.
11. H. Touati, R.K. Brayton, and R. Kurshan. Testing language containment for ω-automata using BDDs. Inf. and Comp., 118(1): 101-109, April 1995.
12. S. Tasiran, R. Hojati, and R.K. Brayton. Language containment using non-deterministic omega-automata. In Proc. of CHARME '95: Advanced Research Working Conference on Correct Hardware design and verification methods, vol. 987 of LNCS. Springer-Verlag, 1995.
13. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers (North-Holland), 1994.
14. K. Takagi, K. Nitta, H. Bouno, Y. Takenaga, and S. Yajima. Computational power of nondeterministic ordered binary decision diagrams and their subclasses. IE ICE Transactions on Fundamentals, E80-A (4): 663-669, April 1997.
15. M.Y. Vardi. Alternating automata and program verification. In J. van Leeuwen, editor, Computer Science Today. Recent Trends and Developments, vol. 1000 of LNCS, pages 471-485. Springer-Verlag, 1995.