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.

B. Aman, G. Ciobanu<br />

{<br />

w i , for all places i ∈ P ;<br />

φ(M)(i) =<br />

µ, i=structure.<br />

ψ(R) = ⋃<br />

ψ(r i ) with ψ(r i ) = t i .<br />

r i∈R<br />

, and<br />

Proof. The functi<strong>on</strong> φ represents a bijecti<strong>on</strong> between the multisets of objects<br />

of Π and the markings of CP N Π based <strong>on</strong> the corresp<strong>on</strong>ding links between objects<br />

and tokens, and between membranes and places, respectively. Let (w 1 , . . . ,<br />

w k , µ) be the multisets of objects from the membrane c<strong>on</strong>figurati<strong>on</strong> M, together<br />

with its structure µ. Similarly, for a set of rules R ′ = {r 1 , . . . , r i } of Π, the<br />

functi<strong>on</strong> ψ is a bijecti<strong>on</strong> c<strong>on</strong>structing the set ψ(R ′ ) = {t 1 , . . . , t i } of transiti<strong>on</strong>s<br />

of CP N Π from the set R of rules.<br />

A membrane c<strong>on</strong>figurati<strong>on</strong> M 1 can evolve to a membrane c<strong>on</strong>figurati<strong>on</strong> M 2 by<br />

applying an evoluti<strong>on</strong> rule r from R ′ if and <strong>on</strong>ly if, given the marking φ(M 1 ), <strong>on</strong>e<br />

obtains the marking φ(M 2 ) by firing a transiti<strong>on</strong> t in CP N Π , where ψ(R ′ )(t) = r.<br />

Overall, this is a direct c<strong>on</strong>sequence of the fact that ψ and φ are bijecti<strong>on</strong>s. ⊓⊔<br />

From the c<strong>on</strong>structi<strong>on</strong> above, it results that the initial c<strong>on</strong>figurati<strong>on</strong> of Π<br />

corresp<strong>on</strong>ds through φ to the initial marking of CP N Π . Moreover, according to<br />

Theorem 1, it results that the computati<strong>on</strong> of Π coincides with the computati<strong>on</strong><br />

of the CP N Π .<br />

6 Simulating LDL Degradati<strong>on</strong> by Using CPN Tools<br />

Now the LDL degradati<strong>on</strong> pathway descripti<strong>on</strong> by using mobile membranes could<br />

be encoded in colored Petri nets. Such an encoding is provided to allow the use<br />

of a complex software tool able to verify automatically some important behavioral<br />

properties. Some decidability results for behavioral properties of membrane<br />

systems with peripheral proteins are presented in [5], but they cannot be proven<br />

automatically. For colored Petri nets is available a complex software called CPN<br />

Tools in which simulati<strong>on</strong>s can be performed, and certain behavioral properties<br />

can be checked automatically: reachability, boundedness, deadlock, liveness,<br />

fairness. CPN Tools (www/cs/au.dk/CPNTools) is a tool for editing, simulating,<br />

state space analysis, and performance analysis of systems described as colored<br />

Petri nets.<br />

In what follows we show how the rules of mobile membranes used to model<br />

the LDL degradati<strong>on</strong> pathway can be simulated using the CPN Tools. To make<br />

easier to observe how the evoluti<strong>on</strong> takes place using CPN Tools, we simplify<br />

the system and use <strong>on</strong>ly the transiti<strong>on</strong>s that eventually occur.<br />

A CPN model is always created in CPN Tools as a graphical drawing. Figure 3<br />

describes the LDL degradati<strong>on</strong> pathway model, namely the membrane c<strong>on</strong>figurati<strong>on</strong><br />

M 1 from Secti<strong>on</strong> 3. The diagram c<strong>on</strong>tains eight places, four substituti<strong>on</strong><br />

transiti<strong>on</strong>s (drawn as double-rectangular boxes), a number of directed arcs c<strong>on</strong>necting<br />

places and transiti<strong>on</strong>s, and finally some textual inscripti<strong>on</strong>s next to the<br />

places, transiti<strong>on</strong>s and arcs. The arc expressi<strong>on</strong>s are built from variables, c<strong>on</strong>stants,<br />

operators, and functi<strong>on</strong>s. When all variables in an expressi<strong>on</strong> are bound<br />

134

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

Saved successfully!

Ooh no, something went wrong!