Model checking
Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Safety and Reachability of Piecewise Linear Hybrid Dynamical Systems Based on Discrete Abstractions
Discrete Event Dynamic Systems
Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
Theoretical Computer Science - Special issue: Computational systems biology
Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures
IEEE Transactions on Software Engineering
System Modeling in Cellular Biology: From Concepts to Nuts and Bolts
System Modeling in Cellular Biology: From Concepts to Nuts and Bolts
Model checking liveness properties of genetic regulatory networks
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Progress on reachability analysis of hybrid systems using predicate abstraction
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Reachability analysis of multi-affine systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Machine learning biochemical networks from temporal logic properties
Transactions on Computational Systems Biology VI
Parallel Model Checking Large-Scale Genetic Regulatory Networks with DiVinE
Electronic Notes in Theoretical Computer Science (ENTCS)
Parameter Synthesis for Piecewise Affine Systems from Temporal Logic Specifications
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Logical Verification and Systematic Parametric Analysis in Train Control
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Parameter Synthesis in Nonlinear Dynamical Systems: Application to Systems Biology
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
On algorithmic analysis of transcriptional regulation by LTL model checking
Theoretical Computer Science
Computing Reachable States for Nonlinear Biological Models
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
European Train Control System: A Case Study in Formal Verification
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Model checking liveness properties of genetic regulatory networks
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Computing reachable states for nonlinear biological models
Theoretical Computer Science
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
Black box checking for biochemical networks
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
A box-based distance between regions for guiding the reachability analysis of spaceex
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Hi-index | 0.01 |
The lack of precise numerical information for the values of biological parameters severely limits the development and analysis of models of genetic regulatory networks. To deal with this problem, we propose a method for the analysis of genetic regulatory networks with parameter uncertainty. We consider models based on piecewise-multiaffine differential equations, dynamical properties expressed in temporal logic, and intervals for the values of uncertain parameters. The problem is then either to guarantee that the system satisfies the expected properties for every possible parameter value - the corresponding parameter set is then called valid - or to find valid subsets of a given parameter set. The proposed method uses discrete abstractions and model checking, and allows for efficient search of the parameter space. This approach has been implemented in a tool for robust verification of gene networks (RoVerGeNe) and applied to the tuning of a synthetic network build in E. coli.