Formal proof of theorems on genetic regulatory networks

Abstract : We describe the formal verification of two theorems of theoretical biology. These theorems concern genetic regulatory networks: they give, in a discrete modeling framework, relations between the topology and the dynamics of these biological networks. In the considered discrete modeling framework, the dynamics is described by a transition graph, where vertices are vectors indicating the expression level of each gene, and where edges represent the evolution of these expression levels. The topology is also described by a graph, called interaction graph, where vertices are genes and where edges correspond to influences between genes. The two results we formalize show that circuits of some kind must be present in the interaction graph if some behaviors are possible in the transition graph. This work was performed with the ssreflect extension of the Coq system.
Document type :
Conference papers
SYNASC'09, Sep 2009, Timisoara, Romania. IEEE, 2009, Synasc 2009, 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Liste complète des métadonnées

https://hal.inria.fr/inria-00504065
Contributor : Yves Bertot <>
Submitted on : Monday, July 19, 2010 - 4:58:12 PM
Last modification on : Monday, September 3, 2018 - 10:56:02 AM

Identifiers

  • HAL Id : inria-00504065, version 1

Collections

Citation

Maxime Dénès, Benjamin Lesage, Yves Bertot, Adrien Richard. Formal proof of theorems on genetic regulatory networks. SYNASC'09, Sep 2009, Timisoara, Romania. IEEE, 2009, Synasc 2009, 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. 〈inria-00504065〉

Share

Metrics

Record views

257