09.09.2014 Views

13th International Conference on Membrane Computing - MTA Sztaki

13th International Conference on Membrane Computing - MTA Sztaki

13th International Conference on Membrane Computing - MTA Sztaki

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Modelling ecological systems with the calculus of wrapped compartments<br />

to take place. In the standard approach the reacti<strong>on</strong> propensity is obtained by<br />

multiplying the rate of the reacti<strong>on</strong> by the number of possible combinati<strong>on</strong>s of<br />

reactants in the compartment in which the reacti<strong>on</strong> takes place, modelling the<br />

law of mass acti<strong>on</strong>.<br />

Stochastic rewrite rules are thus enriched with a rate k (notati<strong>on</strong> l : P ↦−→<br />

k<br />

k<br />

O). Evaluating the propensity of the stochastic rewrite rule R = l : a b ↦−→ c<br />

within the term t = a a a b b, c<strong>on</strong>tained in the compartment u = (• ⌋ t) l , we<br />

must c<strong>on</strong>sider the number of the possible combinati<strong>on</strong>s of reactants of the form<br />

a b in t. Since each occurrence of a can react with each occurrence of b, this<br />

number is 3 · 2, and the propensity of R within u is k · 6. A detailed method to<br />

compute the number of combinati<strong>on</strong>s of reactants can be found in [27].<br />

The stochastic simulati<strong>on</strong> algorithm produces essentially a C<strong>on</strong>tinuous Time<br />

Markov Chain (CTMC). Given a term t, a set R of rewrite rules, a global time<br />

δ and all the reducti<strong>on</strong>s e 1 , . . . , e M applicable in all the different compartments<br />

of t with propensities r 1 , . . . , r M , Gillespie’s “direct method” determines:<br />

– The exp<strong>on</strong>ential probability distributi<strong>on</strong> (with parameter r = ∑ M<br />

i=1 r i) of<br />

the time τ after which the next reducti<strong>on</strong> will occur;<br />

– The probability r i /r that the reducti<strong>on</strong> occurring at time δ + τ will be e i . 6<br />

The CWC simulator [2] is a tool under development at the Computer Science<br />

Department of the Turin University, based <strong>on</strong> Gillespie’s direct method<br />

algorithm [32]. It treats CWC models with different rating semantics (law of<br />

mass acti<strong>on</strong>, Michaelis-Menten kinetics, Hill equati<strong>on</strong>) and it can run independent<br />

stochastic simulati<strong>on</strong>s over CWC models, featuring deep parallel optimizati<strong>on</strong>s<br />

for multi-core platforms <strong>on</strong> the top of FastFlow [5]. It also performs <strong>on</strong>line<br />

analysis by a modular statistical framework [4,3].<br />

3 Modelling Ecological Systems in CWC<br />

We present some of the characteristic features leading the evoluti<strong>on</strong> of ecological<br />

systems, and we show how to encode it within CWC.<br />

3.1 Populati<strong>on</strong> Dynamics<br />

Models of populati<strong>on</strong> dynamics describe the changes in the size and compositi<strong>on</strong><br />

of populati<strong>on</strong>s.<br />

The exp<strong>on</strong>ential growth model is a comm<strong>on</strong> mathematical model for populati<strong>on</strong><br />

dynamics, where, using r to represent the pro-capita growth rate of a<br />

populati<strong>on</strong> of size N, the change of the populati<strong>on</strong> is proporti<strong>on</strong>al to the size of<br />

the already existing populati<strong>on</strong>:<br />

dN<br />

dt = r · N<br />

6 Reducti<strong>on</strong>s are applied in a sequential way, <strong>on</strong>e at each step.<br />

389

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!