General Information
| Description | A hybrid-logic model checker for branching-time Boolean GRN analysis |
| Homepage | http://turing.iimas.unam.mx:8080/AntelopeWEB/ |
Publications
"Antelope": a hybrid-logic model checker for branching-time Boolean GRN analysis
Background
In Thomas' formalism for modeling gene regulatory networks (GRNs), , where a state can have , plays a prominent role. By representing a certain degree of unpredictability, branching time can model several important phenomena, such as (a) asynchrony, (b) incompletely specified behavior, and (c) interaction with the environment. Introducing more than one possible future for a state, however, creates a difficulty for ordinary simulators, because paths may appear, limiting ordinary simulators to statistical conclusions. for branching time, by contrast, are able to prove properties in the presence of infinitely many paths.
Results
We have developed ("Analysis of Networks through TEmporal-LOgic sPEcifications", http://turing.iimas.unam.mx:8080/AntelopeWEB/), a model checker for analyzing and constructing Boolean GRNs. Currently, software systems for Boolean GRNs use branching time almost exclusively for asynchrony. , by contrast, also uses branching time for incompletely specified behavior and environment interaction. We show the usefulness of modeling these two phenomena in the development of a Boolean GRN of the root stem cell niche.There are two obstacles to a direct approach when applying model checking to Boolean GRN analysis. First, ordinary model checkers normally only verify whether or not a set of model states has a given property. In comparison, a model checker for Boolean GRNs is preferable if it the set of states having a desired property. Second, for efficiency, the expressiveness of many model checkers is limited, resulting in the inability to express some interesting properties of Boolean GRNs. tries to overcome these two drawbacks: Apart from reporting the set of all states having a given property, our model checker can express, at the expense of efficiency, some properties that ordinary model checkers (e.g., NuSMV) cannot. This additional expressiveness is achieved by employing a logic extending the standard Computation-Tree Logic (CTL) with hybrid-logic operators.
Conclusions
We illustrate the advantages of when (a) modeling incomplete networks and environment interaction, (b) exhibiting the set of all states having a given property, and (c) representing Boolean GRN properties with hybrid CTL.
Related Tools
NARROMI
Published October 2012
A noise and redundancy reduction technique improves accuracy of gene regulatory network inference
GSD
Published January 2013
A Cytoscape plugin for the generation and the identification of gene regulatory networks describing a stochastic cell di...
PyBoolNet
Published December 2016
A python package for the generation, analysis and visualization of boolean networks
FAIR Evaluation
Sorry, you must be signed in to evaluate this object.
