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., et al.: Algebraic decision diagrams and their applications. FMSD 10(2-3), 171–206 (1997)
3. Lecture Notes in Computer Science;A. Biere,1999
4. Burch, J.R., Clarke, E.M., Long, D.E.: Symbolic model checking with partitioned transition relations. In: VLSI, pp. 49–58 (1991)
5. Cabodi, G., Nocco, S., Quer, S.: Are BDDs still alive within sequential verification? STTT 7(2), 129–142 (2005)