Approximating Attractors of Boolean Networks by Iterative CTL Model Checking.

ABSTRACT: This paper introduces the notion of approximating asynchronous attractors of Boolean networks by minimal trap spaces. We define three criteria for determining the quality of an approximation: "faithfulness" which requires that the oscillating variables of all attractors in a trap space correspond to their dimensions, "univocality" which requires that there is a unique attractor in each trap space, and "completeness" which requires that there are no attractors outside of a given set of trap spaces. Each is a reachability property for which we give equivalent model checking queries. Whereas faithfulness and univocality can be decided by model checking the corresponding subnetworks, the naive query for completeness must be evaluated on the full state space. Our main result is an alternative a

SUBMITTER: Klarner H 

PROVIDER: S-EPMC4562258 | biostudies-literature | 2015

REPOSITORIES: biostudies-literature