1. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers C-35, 677–691 (1986)
2. Wegener, I.: Branching Programs and Binary Decision Diagrams: Theory and Application. SIAM Monographs on Discrete Mathematics and Applications (2000)
3. Lecture Notes in Computer Science;K. Fisler,2001
4. Emerson, E., Lei, C.: Efficient model-checking in fragments of propositional model mu-calculus. In: Proceedings of LIC 1986, pp. 267–278 (1986)
5. Ravi, K., Bloem, R., Somenzi, F.: A comparative study of symbolic algorithms for the computation of fair cycles. In: International Conference on Formal Methods for Computer-Aided Verification, pp. 143–160. Springer, Heidelberg (2000)