about this paper

presentation abstract bibitem

downloads

slides editor link paper (revised version)
Ferdinanda Camporesi, Jérôme Feret.
Formal reduction of rule-based models.
In Postproceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, MFPS XXVI. Pittsburg, PA, USA, May 25 -- 28, 2011, Electonic Notes in Computer Science, volume 276, M. Mislove & J. Ouaknine (Eds.), pp. 31--61.
© Elsevier Science.

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. 

@inProceedings{Feret-MFPSXXVII,
   author =    {Ferdinanda Camporesi and J\'er\^ome Feret},
   title =     {Formal reduction of rule-based models},
   booktitle = {Postproceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, MFPS XXVII},
 
   address =   {Pittsburg, USA},
   publisher = {Elsevier Science Publishers},
   volume =    {276C},
   series =    {Electonic Notes in Theoretical Computer Science},
   pages =     {31--61},
   month =     {25--28 May},
   year =      {2011}
}