An efficient algorithm for computing fixed length attractors based on bounded model checking in synchronous Boolean networks with biochemical applications
used the bounded model checking to quickly locate fixed length attractors. Based on the SAT solver, we propose a new algorithm for efficiently computing the fixed length attractors, which

