Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Semantics of Biological Regulatory Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Necessary conditions for multistationarity in discrete dynamical systems
Discrete Applied Mathematics
Analysing formal models of genetic regulatory networks with delays
International Journal of Bioinformatics Research and Applications
A Reduction of Logical Regulatory Graphs Preserving Essential Dynamical Properties
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Decision diagrams for the representation and analysis of logical models of genetic networks
CMSB'07 Proceedings of the 2007 international conference on Computational methods in systems biology
Stochasticity in reactions: a probabilistic Boolean modeling approach
Proceedings of the 8th International Conference on Computational Methods in Systems Biology
Refining dynamics of gene regulatory networks in a stochastic π-calculus framework
Transactions on computational systems biology XIII
Incorporating time delays into the logical analysis of gene regulatory networks
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
IPCAT'12 Proceedings of the 9th international conference on Information Processing in Cells and Tissues
Static analysis of biological regulatory networks dynamics using abstract interpretation
Mathematical Structures in Computer Science
Hi-index | 0.00 |
The Process Hitting (PH) is a recently introduced framework to model concurrent processes. Its major originality lies in a specific restriction on the causality of actions, which makes the formal analysis of very large systems tractable. PH is suitable to model Biological Regulatory Networks (BRNs) with complete or partial knowledge of cooperations between regulators by defining the most permissive dynamics with respect to these constraints. On the other hand, the qualitative modeling of BRNs has been widely addressed using René Thomas' formalism, leading to numerous theoretical work and practical tools to understand emerging behaviors. Given a PH model of a BRN, we first tackle the inference of the underlying Interaction Graph between components. Then the inference of corresponding Thomas' models is provided using Answer Set Programming, which allows notably an efficient enumeration of (possibly numerous) compatible parametrizations. In addition to giving a formal link between different approaches for qualitative BRNs modeling, this work emphasizes the ability of PH to deal with large BRNs with incomplete knowledge on cooperations, where Thomas' approach fails because of the combinatorics of parameters.