Bounded model checking

An efficient algorithm for computing fixed length attractors based on bounded model checking in synchronous Boolean networks with biochemical applications

X. Y. Li, Yang, G. W., Zheng, D. S., Guo, W. S., and Hung, W. N. N., An efficient algorithm for computing fixed length attractors based on bounded model checking in synchronous Boolean networks with biochemical applications, vol. 14, pp. 4238-4244, 2015.

Genetic regulatory networks are the key to understanding biochemical systems. One condition of the genetic regulatory network under different living environments can be modeled as a synchronous Boolean network. The attractors of these Boolean networks will help biologists to identify determinant and stable factors. Existing methods identify attractors based on a random initial state or the entire state simultaneously. They cannot identify the fixed length attractors directly.

Subscribe to Bounded model checking