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.

<strong>Membrane</strong>s with local envir<strong>on</strong>ments<br />

If we have a membrane system Π, and the generated membrane approximati<strong>on</strong><br />

space PASM(Π), then we can define the border of a regi<strong>on</strong> as an mset. To<br />

introduce c<strong>on</strong>strains <strong>on</strong> symport/antiport rules we need not <strong>on</strong>ly the border of<br />

a regi<strong>on</strong> but ‘inside’ and ‘outside’ borders as well.<br />

Definiti<strong>on</strong> 8. Let Π be a P system, V = {a 1 , a 2 , . . . , a n } and PASM(Π) be a<br />

membrane approximati<strong>on</strong> space generated by the P system Π as in Definiti<strong>on</strong> 7.<br />

Let the sets Γi u, Γ i l of indices (for all w0 i ) be as follows:<br />

– u(w 0 i ) = ⊔ {B γ | B γ ∈ B γ ∈ Γ u i },<br />

– l(w 0 i ) = ⊔ {B γ | B γ ∈ B γ ∈ Γ l i }.<br />

Then<br />

1. border(w 0 i ) = ⊔ {B γ | γ ∈ Γ u i \ Γ l i };<br />

2. border out (w 0 i ) = ⊔ {B γ ⊖ w 0 i | γ ∈ Γ u i \ Γ l i };<br />

3. border in (w 0 i ) = ⊔ {B γ ⊖ (B γ ⊖ w 0 i ) | γ ∈ Γ u i \ Γ l i }.<br />

Remark 9. The mset border(wi 0 ) is definable in the generated membrane approximati<strong>on</strong><br />

space PASM(Π) for all i.<br />

Using the borders of regi<strong>on</strong>s, the following c<strong>on</strong>straint for rule executi<strong>on</strong>s can<br />

be prescribed: a given rule r ∈ R i of a membrane i has to work <strong>on</strong>ly in the border<br />

of its regi<strong>on</strong>. In order to be so, let the executi<strong>on</strong> of a rule r ∈ R i (i = 1, 2, . . . , m)<br />

define in the following forms:<br />

– if a symport rule has the form 〈u, in〉, it is executed <strong>on</strong>ly in that case when<br />

u ⊑ border out (w 0 i );<br />

– if a symport rule has the form 〈u, out〉, it is executed <strong>on</strong>ly in that case when<br />

u ⊑ border in (w 0 i );<br />

– if an antiport rule has the form 〈u, in; v, out〉, it is executed <strong>on</strong>ly in that case<br />

when u ⊑ border out (w 0 i ) and v ⊑ borderin (w 0 i ).<br />

The next theorem shows that the membrane computati<strong>on</strong> actually works in<br />

the membrane borders.<br />

Theorem 1. Let Π = 〈V, µ, w1, 0 w2, 0 . . . , wm, 0 R 1 , R 2 , . . . , R m 〉 be a P system<br />

where the communicati<strong>on</strong> rules in R i (i = 1, 2, . . . , m) are c<strong>on</strong>strained as above,<br />

and PASM(Π) = 〈MS

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

Saved successfully!

Ooh no, something went wrong!