2021/04/28 by Lucia Nasti, Nasti, Lucia, Roberta Gori +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #Computational Drug Discovery Methods #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Gene Regulatory Network Analysis #Receptor Mechanisms and Signaling
paper · pdf · doi:10.48550/arxiv.2104.13831
openalex publication_date 2021/04/28 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28
Robustness is an observable property for which a chemical reaction network\n(CRN) can maintain its functionalities despite the influence of different\nperturbations. In general, to verify whether a network is robust, it is\nnecessary to consider all the possible parameter configurations. This is a\nprocess that can entail a massive computational effort. In the work of Rizk et\nal., the authors propose a definition of robustness in linear temporal logic\n(LTL) through which, on the basis of multiple numerical timed traces obtained\nby considering different parameter configurations, they verify the robustness\nof a reaction network. In this paper, we focus on a notion of initial\nconcentration robustness (\α-robustness), which is related to the\ninfluence of the perturbation of the initial concentration of one species\n(i.e., the input) on the concentration of another species (i.e., the output) at\nthe steady state. We characterize this notion of robustness in the framework\nproposed by Rizk et al., and we show that, for monotonic reaction networks,\nthis allows us to drastically reduce the number of traces necessary to verify\nrobustness of the CRN.\n