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.

Mobile membranes with objects <strong>on</strong> surface as colored Petri nets<br />

k!<br />

Thus, s = s 1 ∗ k + s 2 ∗<br />

2!(k − 2)! + s k!<br />

3 ∗<br />

2!(k − 2)! , where s 1, s 2 and s 3<br />

represent the numbers of pino, phago and exo rules from R.<br />

◦ A c<strong>on</strong>tains input arcs (P × T ) and output arcs (T × P ); for a rule r and its<br />

associated transiti<strong>on</strong> t, we build the arcs as follows:<br />

• the input arcs are both from the places that represent the membranes<br />

appearing in the left hand side of the evoluti<strong>on</strong> rule r and from the place<br />

structure to the transiti<strong>on</strong> t;<br />

• the output arcs are from the transiti<strong>on</strong> t to both the places that represent<br />

the membranes appearing in the right hand side of the evoluti<strong>on</strong> rule r<br />

and to the place structure.<br />

◦ Σ = U ∪ L, where U represents tokens (color) set c<strong>on</strong>taining all the objects<br />

from O, and L = {1, . . . , k} × {1, . . . , k} is a color set c<strong>on</strong>taining the<br />

membrane structure.<br />

◦ X = {x, y, z, . . .} is a set of variables used when modifying the c<strong>on</strong>tent of<br />

place structure.<br />

{<br />

U, if p ∈ {1, . . . , k}<br />

◦ C(p) =<br />

L, if p = structure.<br />

⎧<br />

[x = y], if t is a transiti<strong>on</strong> corresp<strong>on</strong>ding to a phago rule; it checks if<br />

⎪⎨<br />

both membranes from the left hand side of a phago rule<br />

◦ G(t) =<br />

have the same parent;<br />

⎪⎩<br />

true, otherwise.<br />

◦ For a rule r and its associated transiti<strong>on</strong> t, we build E as follows:<br />

• we place the multiset of objects u <strong>on</strong> an input arc from a place that<br />

represents a membrane appearing in the left hand side of the evoluti<strong>on</strong><br />

rule r (being marked with a multiset of objects u) to the transiti<strong>on</strong> t;<br />

• we place all the pairs (i, j) describing the membrane structure appearing<br />

in the left hand side rule r <strong>on</strong> the input arc from the place structure to<br />

the transiti<strong>on</strong> t;<br />

• we place the multiset of objects v <strong>on</strong> an output arc from a transiti<strong>on</strong> t<br />

to a place that represents a membrane appearing in the right hand side<br />

of the evoluti<strong>on</strong> rule r (being marked with a multiset of objects v);<br />

• we place all the pairs (i, j) describing the membrane structure appearing<br />

in the right hand side rule r <strong>on</strong> the output arc from the transiti<strong>on</strong> t to<br />

the place structure.<br />

{<br />

w 0<br />

◦ I(p) =<br />

p, if p ∈ {1, . . . , k}<br />

{(i, j) | i, j ∈ {1, . . . , k}, (i, j) ∈ µ}.<br />

We prove formally the relati<strong>on</strong>ship between the dynamics of the mobile membrane<br />

Π and that of the corresp<strong>on</strong>ding colored Petri net CP N Π .<br />

Theorem 1. If M and M ′ are two membrane c<strong>on</strong>figurati<strong>on</strong>s of Π, then<br />

where<br />

M ⇒ R′<br />

M ′ if and <strong>on</strong>ly if φ(M) [ψ(R ′ )〉 φ(M ′ ),<br />

133

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

Saved successfully!

Ooh no, something went wrong!