The Community for Technology Leaders
Logic in Computer Science, Symposium on (2010)
Edinburgh, United Kingdom
July 11, 2010 to July 14, 2010
ISSN: 1043-6871
ISBN: 978-0-7695-4114-3
pp: 362-381
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.
Vincent Danos, Russell Harmer, Jérôme Feret, Jean Krivine, Walter Fontana, "Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction", Logic in Computer Science, Symposium on, vol. 00, no. , pp. 362-381, 2010, doi:10.1109/LICS.2010.44
95 ms
(Ver 3.3 (11022016))