Acta Informatica · 2016 · 12 citations · 16 references
Life SciencesBiologyEvolutionary BiologyFormal MethodsGene RegulationGene Regulatory NetworksBoolean Network ModelsEvolutionary ComputationModel CheckingFormal VerificationGene Regulatory Network ModelsLinear ConstraintsLinear Temporal LogicMutational RobustnessParameter SynthesisRegulatory Gene NetworksStatistical Testing
The behaviour of gene regulatory networks (GRNs) is typically analysed using simulation-based statistical testing-like methods. In this paper, we demonstrate that we can replace this approach by a formal verification-like method that gives higher assurance and scalability. We focus on Wagner’s weighted GRN model with varying weights, which is used in evolutionary biology. In the model, weight parameters represent the gene interaction strength that may change due to genetic mutations. For a property of interest, we synthesise the constraints over the parameter space that represent the set of GRNs satisfying the property. We experimentally show that our parameter synthesis procedure computes the mutational robustness of GRNs—an important problem of interest in evolutionary biology—more efficiently than the classical simulation method. We specify the property in linear temporal logic. We employ symbolic bounded model checking and SMT solving to compute the space of GRNs that satisfy the property, which amounts to synthesizing a set of linear constraints on the weights.
16
A synthetic oscillatory network of transcriptional regulators
Michael B. Elowitz, Stanislas Leibler · Nature · 2000 · 4.8K citations
Construction of a genetic toggle switch in Escherichia coli
Timothy S. Gardner, Charles R. Cantor, James J. Collins · Nature · 2000 · 4.4K citations
Efficient Conflict Driven Learning in a Boolean Satisfiability Solver
2001 · 666 citations
Vincent Danos, Cosimo Laneve · Theoretical Computer Science · 2004 · 501 citations