Approximating Attractors of Boolean Networks by Iterative CTL Model Checking
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...
| Main Authors: | , |
|---|---|
| Format: | Online |
| Language: | English |
| Published: |
Frontiers Media S.A.
2015
|
| Online Access: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4562258/ |