Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. A. Anuchitanukul, Z. Manna, and T. E. Uribe. Differential BDDs. Lecture Notes in Computer Science, 1000:218–233, 1995.
2. A. Biere. Effiziente _-Kalkül Modellprüfung mit Binären Entscheidungsdiagrammen. PhD thesis, Fakultät für Informatik, Universität Karlsruhe, 1997.
3. J. Bitner, J. Jain, M. Abadir, J. Abraham, and D. Fussell. Efficient algorithmic verification using indexed BDD’s. In International Symposium on Fault-Tolerant Systems, pages 266–275, 1994.
4. M. C. Browne, E. M. Clarke, and O. Grumberg. Reasoning about networks with many identical finite state processes. Information and Computation, 81(1):13–31, Apr. 1989.
5. [5] R. Bryant. Graph based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677–691, 1986.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams;ACM Transactions on Programming Languages and Systems;2024-05-02