2009
DOI: 10.1016/j.tcs.2009.02.017
|View full text |Cite
|
Sign up to set email alerts
|

On algorithmic analysis of transcriptional regulation by LTL model checking

Abstract: a b s t r a c tStudies of cells in silico can greatly reduce the need for expensive and prolonged laboratory experimentation. The use of model checking for the analysis of biological networks has attracted much attention recently. The practical limitations are still the size of the model, and the time needed to generate the state space. This paper is focused on the model checking approach for analysis of piecewise-linear deterministic models of genetic regulatory networks. Firstly, the qualitative simulation a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 24 publications
(50 reference statements)
0
9
0
Order By: Relevance
“…Several approaches consist in the abstraction of continuous models into discrete transition systems (e.g. [ 3 6 ]); this may enable the use of model checking as a state space exploration technique [ 3 , 7 , 8 ]. Our approach is based on Timed Automata models [ 9 ] defined by linear approximations (with arbitrary precision) of ordinary differential equations (ODEs); this has the benefit of using existing mature Timed Automata analysis techniques.…”
Section: Introductionmentioning
confidence: 99%
“…Several approaches consist in the abstraction of continuous models into discrete transition systems (e.g. [ 3 6 ]); this may enable the use of model checking as a state space exploration technique [ 3 , 7 , 8 ]. Our approach is based on Timed Automata models [ 9 ] defined by linear approximations (with arbitrary precision) of ordinary differential equations (ODEs); this has the benefit of using existing mature Timed Automata analysis techniques.…”
Section: Introductionmentioning
confidence: 99%
“…As a consequence, the derivatives of the concentration variables have a unique sign pattern : for all x , y ∈ D , it holds that sign( F i ( x )) = sign( F i ( y )) ⊆ {−1, 0, 1}, where sign( A ) ≜ {sign( a )∣ a ∈ A } denotes the signs of the elements in A (Batt et al , 2008 ). Notice that this property is not obtained for less fine-grained partitions used in related work (Barnat et al , 2009 ; Bernot et al , 2004 ; Chaves et al , 2009 ; Corblin et al , 2009 ; Fauré et al , 2006 ; Fromentin et al , 2007 ). It will be found critical for the search of parametrized models of IRMA that satisfy the time-series data.…”
Section: Search Of Parameter Space Using Symbolic Model Checkingmentioning
confidence: 87%
“…The computer tool GNA has been extended to export the symbolic encoding of PADE models in the NuSMV language (Cimatti et al , 2002 ). In comparison with related work (Barnat et al , 2009 ; Bernot et al , 2004 ; Corblin et al , 2009 ; Fromentin et al , 2007 ), our method applies to incompletely instead of fully parametrized models, provides more precise results and the encoding is efficient without (strongly) simplifying the PADE dynamics.…”
Section: Introductionmentioning
confidence: 88%
“…In our previous work [9] we have dealt with parallel model checking analysis of piece-wise affine ODE models [10]. The method allows fully qualitative analysis, since in the piece-wise affine approximation generating of the state space does not require to numerically enumerate the equations.…”
Section: A Related Workmentioning
confidence: 99%