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 Büuchi 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.
This research was supported in part by the National Science Foundation grant CCR-99-00984-001, by ARO grant DAAG55-98-1-0471, by ARO/MURI grant DAAH04-96-1-0341, by ARPA/Army contract DABT63-96-C-0096, and by ARPA/AirForce contracts F33615-00-C-1693 and F33615-99-C-3014.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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.
V. Bertacco and M. Damiani. Boolean function representation using parallel access diagrams. In The Sixth Great Lakes Symposium on VLSI. IEEE, 1996.
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.
R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677–691, August 1986.
E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
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.
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.
D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54(2–3):267–276, October 1987.
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. Colloq. Aut. Lang. Prog., vol. 1853, pages 429–450, Geneva, Switzerland, July 2000. Springer-Verlag.
S. Safra. On the complexity of !-automata. In Proc. 29th IEEE Symp. Found. of Comp. Sci., pages 319–327, 1988.
H. Touati, R.K. Brayton, and R. Kurshan. Testing language containment for ω-automata using BDDs. Inf. and Comp., 118(1):101–109, April 1995.
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.
W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers (North-Holland), 1994.
K. Takagi, K. Nitta, H. Bouno, Y. Takenaga, and S. Yajima. Computational power of nondeterministic ordered binary decision diagrams and their subclasses. IEICE Transactions on Fundamentals, E80-A(4):663–669, April 1997.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Finkbeiner, B. (2001). Language Containment Checking with Nondeterministic BDDs. In: Margaria, T., Yi, W. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2001. Lecture Notes in Computer Science, vol 2031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45319-9_3
Download citation
DOI: https://doi.org/10.1007/3-540-45319-9_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41865-8
Online ISBN: 978-3-540-45319-2
eBook Packages: Springer Book Archive