Conference Papers Year : 2011

Formal reduction for rule-based models

Abstract

Molecular biological models usually suffer from a large combinatorial explosion. Indeed, proteins form complexes and modify each others, which leads to the formation of a huge number of distinct chemical species (i.e.~non-isomorphic connected components of proteins). Thus we cannot generate explicitly the quantitative semantics of these models, and even less compute their properties. In this paper we propose a formal framework to automatically reduce the combinatorial complexity of the differential semantics of rule-based models. Our reduction is based on two abstractions, which are combined thanks to a generic product. The first abstraction tracks the flow of information between the different regions of chemical species, so as to detect and abstract away some useless correlations between the state of sites. The second abstraction detects pairs of sites having the same capabilities of interaction, and abstracts away any distinction between them. The initial semantics and the reduce one are formally related by Abstract Interpretation.

Fichier principal
Vignette du fichier
MFPS27.pdf (520.19 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Licence

Dates and versions

inria-00636850 , version 1 (16-02-2025)

Licence

Identifiers

Cite

Ferdinanda Camporesi, Jérôme Feret. Formal reduction for rule-based models. the 27th Conference on the Mathematical Foundations of Programming Semantics - MFPS 2011, May 2011, Pittsburgh, United States. pp.29-59, ⟨10.1016/j.entcs.2011.09.014⟩. ⟨inria-00636850⟩
321 View
99 Download

Altmetric

Share

  • More