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.

L.F. Macías-Ramos, M.J. Pérez-Jiménez<br />

is introduced, al<strong>on</strong>g with several examples. Finally, the simulati<strong>on</strong> algorithm is<br />

shown. Secti<strong>on</strong> 5 covers c<strong>on</strong>clusi<strong>on</strong>s and future work.<br />

2 Spiking Neural P Systems with Functi<strong>on</strong>al Astrocytes<br />

In this secti<strong>on</strong>, we introduce SN P Systems with Functi<strong>on</strong>al Astrocytes.<br />

2.1 Syntax<br />

A Spiking Neural P System with Functi<strong>on</strong>al Astrocytes (SNPSFA for short) of<br />

degree (m, l), m ≥ 1, l ≥ 1, is a c<strong>on</strong>struct of the form<br />

Π = (O, σ, syn, ast, out), where:<br />

– O = {a} is the singlet<strong>on</strong> alphabet (a is called spike);<br />

– σ = {σ 1 , . . . , σ m } is the finite set of neur<strong>on</strong>s, of the form σ i = (n i , R i ), 1 ≤<br />

i ≤ m, where:<br />

• n i ≥ 0 is the initial number of spikes c<strong>on</strong>tained in σ i ;<br />

• R i is a finite set of extended rules of the following form:<br />

E/a c → a p<br />

where E is a regular expressi<strong>on</strong> over a, and c ≥ 1, p ≥ 1 with c ≥ p;<br />

– syn = {s 1 , . . . , s θ } ⊆ {1, . . . , m} × {1, . . . , m} with (i, i) ∉ syn is the set of<br />

synapses;<br />

– ast = {ast 1 , . . . , ast l } is the finite set of astrocytes, with ast j , (1 ≤ j ≤ l) of<br />

the form<br />

ast j = (syn o j , sync j , ω j, T j , F j , p j (0), γ j ), where:<br />

• syn o j = {s o j,1 , . . . , so j,r j<br />

} ⊆ syn, r j ≥ 1, is the astrocyte finite set of<br />

operand synapses, ordered by a lexicographical order imposed <strong>on</strong> syn o j ;<br />

• syn c j = {sc j,1 , . . . , sc j,q j<br />

} ⊆ syn, q j ≥ 0, is the astrocyte finite set of c<strong>on</strong>trol<br />

synapses;<br />

• ω j ∈ {true, false} is the astrocyte c<strong>on</strong>trol-as-operand flag;<br />

• T j = {T j,1 , . . . , T j,kj }, k j ≥ 1, is the astrocyte finite set of thresholds,<br />

such that, T j,α ∈ N, (1 ≤ α ≤ k j ) and T j,1 < . . . < T j,kj ;<br />

• F j = {f j,1 , . . . , f j,kj } is the astrocyte finite multiset (some elements in F j<br />

can be the same) of natural functi<strong>on</strong>s such that for each α (1 ≤ α ≤ k j ):<br />

∗ f j,α is a computable functi<strong>on</strong> between natural numbers;<br />

∗ if ω j = true then f j,α is a unary functi<strong>on</strong>;<br />

∗ if ω j = false and r j = 1 then f j,α is a unary c<strong>on</strong>stant functi<strong>on</strong>;<br />

∗ if ω j = false and r j > 1 then f j,α has arity r j − 1;<br />

• p j (0) ∈ N is the astrocyte initial potential;<br />

• γ j ∈ {true, false} is the astrocyte potential update flag;<br />

– out ∈ σ is the output neur<strong>on</strong>.<br />

262

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

Saved successfully!

Ooh no, something went wrong!