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.

Simplifying Event-B models of P systems using functi<strong>on</strong>s<br />

3 Simplified Model of a Tissue P System with<br />

Active <strong>Membrane</strong>s Solving the 3-colouring<br />

Problem<br />

We c<strong>on</strong>sider now the 3-colouring problem: given an undirected graph G =<br />

(V,E), decide if it is possible to colour its nodes using 3 colors such that, for<br />

every edge (u, v) ∈ E, the colours of u and v are different. This problem can be<br />

solved in linear time by Π(n) a family of recognizer tissue P systems with cell<br />

divisi<strong>on</strong> of degree 2 [2]. In the following we will c<strong>on</strong>sider <strong>on</strong>ly a restricted set of<br />

objects, V = {A i ,T i ,R i ,G i ,B i :1≤ i ≤ n}, and the divisi<strong>on</strong> rules associated<br />

with the sec<strong>on</strong>d membrane of the P systems given in [2]:<br />

• r 1i :[A i ] 2 → [R i ] 2 [T i ] 2 , for 1 ≤ i ≤ n<br />

• r 2i :[T i ] 2 → [B i ] 2 [G i ] 2 , for 1 ≤ i ≤ n<br />

Here, A i and T i are n<strong>on</strong>terminal symbols, A i encodes the i−th vertex of the<br />

graph and R i , B i , G i are terminal symbols corresp<strong>on</strong>ding to the three colors<br />

red, blue and green.<br />

As we presented in [5] the Event-B model of a P system has two comp<strong>on</strong>ents.<br />

The first <strong>on</strong>e is a c<strong>on</strong>text that c<strong>on</strong>tains the set of symbols (denoted SYMBOLS)<br />

and the c<strong>on</strong>stant n with a fixed n<strong>on</strong>negative value.<br />

The sec<strong>on</strong>d comp<strong>on</strong>ent is a machine with the following variables:<br />

- a partial functi<strong>on</strong> used to represent the structure of the P system, except the<br />

skin: cell ∈ N → (SY MBOLS → ({1,...,n}→N)) with the following significati<strong>on</strong>:<br />

cell(x)(a)(i) represents the number of objects a with the index i in the<br />

membrane x;<br />

- mark : N →{0, 1} a partial functi<strong>on</strong> used “to mark” cells produced in a divisi<strong>on</strong><br />

rule or involved in a communicati<strong>on</strong> rule between two steps of maximal<br />

parallelism; such cells cannot be the subject of another divisi<strong>on</strong> or communicati<strong>on</strong><br />

rule in the same computati<strong>on</strong> step.<br />

Using the modelling approach that we propose, we associate to the first set<br />

of rules the following event:<br />

Rule 1i<br />

any<br />

x, y, z, i<br />

where<br />

then<br />

grd1 : x ∈ dom(cell)&mark(x) =0&i ∈ 1 ...n& cell(x)(a)(i) ≥ 1<br />

grd2 : y ∈ N \ dom(cell)&z ∈ N \ dom(cell)&y ≠ z<br />

457

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

Saved successfully!

Ooh no, something went wrong!