Skip to Main content Skip to Navigation

Computation Tree Regular Logic for Genetic Regulatory Networks

Radu Mateescu 1, * Pedro Monteiro 2 Estelle Dumas 2 Hidde de Jong 2 
* Corresponding author
1 VASY - System validation - Research and applications
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
2 IBIS - Modeling, simulation, measurement, and control of bacterial regulatory networks
LAPM - Laboratoire Adaptation et pathogénie des micro-organismes [Grenoble], Inria Grenoble - Rhône-Alpes, Institut Jean Roget
Abstract : Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (GRNs) that govern the functioning of living cells. The applications of model checking in systems biology have revealed that temporal logics should be able to capture both branching-time and fairness properties (needed for specifying multistability and oscillation properties, respectively). At the same time, they should have a user-friendly syntax easy to employ by non-experts. In this report, we define Computation Tree Regular Logic (CTRL), an extension of CTL with regular expressions and fairness operators that attempts to match these criteria. CTRL subsumes both CTL and LTL, and has a reduced set of temporal operators indexed by regular expressions, inspired from the modalities of Propositional Dynamic Logic (PDL). We also develop a translation of CTRL into Hennessy-Milner Logic with Recursion (HMLR), an equational variant of the modal mu-calculus. This has allowed us to obtain an on-the-fly model checker with diagnostic for CTRL by directly reusing the verification technology available in the CADP toolbox. We illustrate the application of the CTRL model checker by analyzing the GRN controlling the carbon starvation response of Escherischia coli.
Complete list of metadata

Cited literature [57 references]  Display  Hide  Download
Contributor : Radu Mateescu Connect in order to contact the contributor
Submitted on : Wednesday, May 14, 2008 - 4:33:44 PM
Last modification on : Tuesday, August 2, 2022 - 4:25:02 AM
Long-term archiving on: : Tuesday, September 21, 2010 - 4:56:44 PM


Files produced by the author(s)


  • HAL Id : inria-00277995, version 2


Radu Mateescu, Pedro Monteiro, Estelle Dumas, Hidde de Jong. Computation Tree Regular Logic for Genetic Regulatory Networks. [Research Report] RR-6521, INRIA. 2008, pp.53. ⟨inria-00277995v2⟩



Record views


Files downloads