1. Abdulla P., Iyer S., Nylén A.: SAT-solving the coverability problem for Petri nets. FMSD 24(1), 25–43 (2004)
2. Bahar R.I., Frohm E.A., Gaona C.M., Hachtel G.D., Macii E., Pardo A., Somenzi F.: Algebraic decision diagrams and their applications. FMSD 10(2/3), 171–206 (1997)
3. Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without BDDs. In: TACAS. LNCS, vol. 1579, pp. 193–207. Springer, Berlin (1999)
4. Bryant R.E.: Symbolic boolean manipulation with ordered binary decision diagrams. ACM Comp. Surv. 24(3), 293–318 (1992)
5. Burch, J.R., Clarke, E.M., Long, D.E.: Symbolic model checking with partitioned transition relations. In: VLSI, pp. 49–58 (1991)