1. Jerry R. Burch, Edmund M. Clarke, and David E. Long. Symbolic model checking with partitioned transition relations. In A. Halaas and P. B. Denyer, editors, Proceedings of the IFIP International Conference on Very Large Scale Integration, Edinburgh, Scotland, August 1991.
2. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8), 1986.
3. Olivier Coudert, Christian Berthet, and Jean Christophe Madre. Verification of synchronous sequential machines based on symbolic execution. In Joseph Sifakis, editor, Automatic Verification Methods for Finite State Systems, International Workshop, Grenoble, France, volume 407 of Lecture Notes in Computer Science. Springer-Verlag, June 1989.
4. J. Gergov and C. Meinel. Efficient boolean manipulation with obdd's can be extended to fbdd's. IEEE Transactions on Computers, 43(10):1197–209, Oct. 1994.
5. A. J. Hu and D. L. Dill. Efficient verification with bdds using implicitly conjoined invariants. In C. Courcoubetis, editor, Computer Aided Verification. 5th International Conference, CAV '93, pages 3–14, Berlin, Germany, 1993. Springer-Verlag.