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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

(Tissue) P systems with decaying objects<br />

– if possible – has to be used. For the basic variant as defined in the following,<br />

in each transiti<strong>on</strong> step we choose a multiset of rules R ′ from Appl (Π, C, asyn)<br />

that cannot be extended to R ′′ ∈ Appl (Π, C, asyn) with R ′′ R ′ and such that<br />

(R ′′ − R ′ ) ∩ R j ≠ ∅ and R ′ ∩ R j = ∅ for some j, 1 ≤ j ≤ p, i.e., extended by a<br />

rule from a set of rules R j from which no rule has been taken into R ′ .<br />

Definiti<strong>on</strong> 5. For the minimally parallel transiti<strong>on</strong> mode with partiti<strong>on</strong>ing Θ<br />

(min(Θ)),<br />

Appl (Π, C, min(Θ)) = {R ′ | R ′ ∈ Appl (Π, C, asyn) and<br />

there is no R ′′ ∈ Appl (Π, C, asyn)<br />

with R ′′ R ′ , (R ′′ \ R ′ ) ∩ R j ≠ ∅<br />

and R ′ ∩ R j = ∅ for some j, 1 ≤ j ≤ p} .<br />

In the k-restricted minimally parallel transiti<strong>on</strong> mode, a multiset of rules<br />

from Appl (Π, C, min(Θ)) can <strong>on</strong>ly be applied if it c<strong>on</strong>tains at most k rules from<br />

each partiti<strong>on</strong> R j , 1 ≤ j ≤ p.<br />

Definiti<strong>on</strong> 6. For the k-restricted minimally parallel transiti<strong>on</strong> mode with partiti<strong>on</strong>ing<br />

Θ (min k (Θ)),<br />

Appl (Π, C, min k (Θ)) = {R ′ | R ′ ∈ Appl (Π, C, min(Θ)) and<br />

|R ′ ∩ R j | ≤ k for all j, 1 ≤ j ≤ p} .<br />

Each multiset of rules obtained by min 1 can be seen as a kind of basic<br />

maximally parallel vector; this interpretati<strong>on</strong> also allows for capturing the understanding<br />

of the minimally parallel transiti<strong>on</strong> mode as introduced by Gheorghe<br />

Păun:<br />

Definiti<strong>on</strong> 7. For the base vector minimally parallel transiti<strong>on</strong> mode with partiti<strong>on</strong>ing<br />

Θ (min GP (Θ)),<br />

Appl (Π, C, min GP (Θ)) = {R ′ | R ′ ∈ Appl (Π, C, min(Θ)) and R ′ ⊇ R ′′<br />

for some R ′′ ∈ Appl (Π, C, min 1 (Θ))} .<br />

In the k-restricted maximally parallel transiti<strong>on</strong> mode, a multiset of rules<br />

can <strong>on</strong>ly be applied if it is maximal but <strong>on</strong>ly c<strong>on</strong>tains at most k rules from each<br />

partiti<strong>on</strong> R j , 1 ≤ j ≤ p.<br />

Definiti<strong>on</strong> 8. For the k-restricted maximally parallel transiti<strong>on</strong> mode with partiti<strong>on</strong>ing<br />

Θ (max k (Θ)),<br />

Appl (Π, C, max k (Θ)) = {R ′ | R ′ ∈ Appl (Π, C, max) and<br />

|R ′ ∩ R j | ≤ k for all j, 1 ≤ j ≤ p} .<br />

Definiti<strong>on</strong> 9. For the the k-restricted maximally parallel transiti<strong>on</strong> mode with<br />

<strong>on</strong>ly <strong>on</strong>e partiti<strong>on</strong>, max k ({R}), we also use the noti<strong>on</strong> k-restricted maximally<br />

parallel transiti<strong>on</strong> mode (max k ), i.e., we get<br />

Appl (Π, C, max k ) = {R ′ | R ′ ∈ Appl (Π, C, max) and |R ′ | ≤ k}.<br />

17

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

Saved successfully!

Ooh no, something went wrong!