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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

An analysis of correlative and quantitative causality in P systems<br />

computing inspired by nature. <strong>Membrane</strong> computing abstracts computing models<br />

from the architecture and the functi<strong>on</strong>ing of living cells, as well as from the<br />

organizati<strong>on</strong> of cells in tissues, organs and, brain.<br />

A transiti<strong>on</strong> P system is the simplest form of membrane system c<strong>on</strong>sisting<br />

of a hierarchy of nested membranes, each membrane c<strong>on</strong>taining objects, rules<br />

and possibly other membranes. The hierarchy of membranes models the compartments<br />

of the biological pathway, the objects represent the species in each<br />

compartments, and the rules corresp<strong>on</strong>d to the biochemical reacti<strong>on</strong>s forming<br />

the pathways. The rules are c<strong>on</strong>sidered to be applied in a maximally parallel<br />

manner. The simplest form of transiti<strong>on</strong> P system is the <strong>on</strong>e with <strong>on</strong>ly <strong>on</strong>e membrane,<br />

which basically c<strong>on</strong>sists of a set of rules and possibly an initial multiset<br />

of objects.<br />

A multiset w over a set A is a functi<strong>on</strong> w : A → N from A to the set of<br />

natural numbers N; the multiplicity of an element a ∈ A is w(a). We denote<br />

the empty multiset having multiplicity 0 for all a ∈ A by 0 A , or simply by 0 if<br />

the set A is clear from the c<strong>on</strong>text. When describing a multiset characterized<br />

by, for example, w(a) = 4, w(b) = 2 and w(c) = 0 for c ∈ A\{a, b}, we use the<br />

representati<strong>on</strong> 4a + 2b. For two multisets v, w over A we say that v is c<strong>on</strong>tained<br />

in w if v(a) ≤ w(a) for all a ∈ A, and we denote this by v ≤ w. If v ≤ w, we<br />

can define w − v by (w − v)(a) = w(a) − v(a). For two multisets v and w we<br />

use the notati<strong>on</strong> v ∩ w for the largest multiset c<strong>on</strong>tained in both v and w. In<br />

other words, v ∩ w is defined by (v ∩ w)(a) = min{v(a), w(a)}, for all a ∈ A. We<br />

denote by v\w the multiset v − v ∩ w. We sometimes use the notati<strong>on</strong> a ∈ w to<br />

denote the fact that w(a) > 0, i.e., the multiset w c<strong>on</strong>tains at least <strong>on</strong>e a.<br />

Formally, a transiti<strong>on</strong> P system with <strong>on</strong>ly <strong>on</strong>e membrane is a tuple Π =<br />

(O, R, u 0 ), where O is an alphabet of objects, R is a set of rules, while u 0 is a<br />

multiset of objects which is initially in the membrane. Each rule r has the form<br />

r : u → v, where u and v are multisets of objects and u is n<strong>on</strong>-empty.<br />

We use multisets of objects over O to represent resources available or being<br />

produced inside the membrane. Then, u 0 evolves by applying the rules in R. We<br />

use the notati<strong>on</strong> lhs(r) for the left hand side u of a rule of form r : u → v and<br />

similarly rhs(r) for the right hand side v. Therefore, by the applicati<strong>on</strong> of the<br />

rule r the lhs(r) is being subtracted from u 0 , if possible, and the rhs(r) is added.<br />

In this way, the rules applicati<strong>on</strong> models biological reacti<strong>on</strong>s. These notati<strong>on</strong>s<br />

are extended naturally to multisets of rules.<br />

We define causality directly, for a multiset of objects v. Note that this definiti<strong>on</strong><br />

differs from the presentati<strong>on</strong> found in [2], where it has been obtained as a<br />

theorem describing (global) causality. Here we present it directly as a definiti<strong>on</strong>,<br />

in the interest of brevity.<br />

Definiti<strong>on</strong> 1 (Quantitative Causality) A multiset of rules G is called a cause<br />

for a multiset of objects v whenever the following hold:<br />

– there is no rule r such that lhs(r) ≤ v\rhs(G);<br />

– rhs(G) ∩ v > rhs(G − r) ∩ v for any rule r ∈ G.<br />

353

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

Saved successfully!

Ooh no, something went wrong!