DocumentCode :
2067286
Title :
Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction
Author :
Danos, Vincent ; Feret, Jerome ; Fontana, Walter ; Harmer, Russell ; Krivine, Jean
Author_Institution :
Univ. of Edinburgh, Edinburgh, UK
fYear :
2010
fDate :
11-14 July 2010
Firstpage :
362
Lastpage :
381
Abstract :
Rule-based approaches (as in our own Kappa, or the BNG language, or many other propositions allowing the consideration of "reaction classes\´\´) offer new and more powerful ways to capture the combinatorial interactions that are typical of molecular biological systems. They afford relatively compact and faithful descriptions of cellular interaction networks despite the combination of two broad types of interaction: the formation of complexes (a biological term for the ubiquitous non-covalent binding of bio-molecules), and the chemical modifications of macromolecules (aka post-translational modifications). However, all is not perfect. This same combinatorial explosion that pervades biological systems also seems to prevent the simulation of molecular networks using systems of differential equations. In all but the simplest cases the generation (and even more the integration) of the explicit system of differential equations which is canonically associated to a rule set is unfeasible. So there seems to be a price to pay for this increase in clarity and precision of the description, namely that one can only execute such rule-based systems using their stochastic semantics as continuous time Markov chains, which means a slower if more accurate simulation. In this paper, we take a fresh look at this question, and, using techniques from the abstract interpretation framework, we construct a reduction method which generates (typically) far smaller systems of differential equations than the concrete/canonical one. We show that the abstract/reduced differential system has solutions which are linear combinations of the canonical ones. Importantly, our method: 1) does not require the concrete system to be explicitly computed, so it is intensional, 2) nor does it rely on the choice of a specific set of rate constants for the system to be reduced, so it is symbolic, and 3) achieves good compression when tested on rule-based models of significant size, so it is also realistic.
Keywords :
Markov processes; abstracting; biology computing; differential equations; knowledge based systems; abstract interpretation framework; automated model reduction; cellular interaction networks; continuous time Markov chains; differential equations; differential semantics; molecular biological systems; molecular networks; rule-based models; rule-based systems; Biological system modeling; Concrete; Correlation; Equations; Mathematical model; Proteins; Semantics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Logic in Computer Science (LICS), 2010 25th Annual IEEE Symposium on
Conference_Location :
Edinburgh
ISSN :
1043-6871
Print_ISBN :
978-1-4244-7588-9
Electronic_ISBN :
1043-6871
Type :
conf
DOI :
10.1109/LICS.2010.44
Filename :
5571737
Link To Document :
بازگشت