Unfolding of Parametric Boolean Networks
| Authors | |
|---|---|
| Year of publication | 2018 |
| Type | Article in Periodical |
| Magazine / Source | Electronic Notes in Theoretical Computer Science |
| MU Faculty or unit | |
| Citation | |
| Web | http://dx.doi.org/10.1016/j.entcs.2018.03.009 |
| Doi | http://dx.doi.org/10.1016/j.entcs.2018.03.009 |
| Keywords | asynchronous systems; Boolean networks; concurrency; parameters identification; systems biology |
| Description | In systems biology, models of cellular regulatory processes such as gene regulatory networks or signalling pathways are crucial to understanding the behaviour of living cells. Available biological data are however often insufficient for full model specification. In this paper, we focus on partially specified models where the missing information is abstracted in the form of parameters. We introduce a novel approach to analysis of parametric logical regulatory networks addressing both sources of combinatoric explosion native to the model. First, we introduce a new compact representation of admissible parameters using Boolean lattices. Then, we define the unfolding of parametric Boolean networks. The resulting structure provides a partial-order reduction of concurrent transitions, and factorises the common transitions among the concrete models. A comparison is performed against state-of-the-art approaches to parametric model analysis |
| Related projects: |