An efficient algorithm for computing fixed length attractors based on bounded model checking in synchronous Boolean networks with biochemical applications
respect to the attractor number and length of attractors. This study used the bounded model checking to quickly locate fixed length attractors. Based on the SAT solver, we propose

