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.

<str<strong>on</strong>g>13th</str<strong>on</strong>g> <str<strong>on</strong>g>Internati<strong>on</strong>al</str<strong>on</strong>g> <str<strong>on</strong>g>C<strong>on</strong>ference</str<strong>on</strong>g> <strong>on</strong> <strong>Membrane</strong> <strong>Computing</strong>, CMC13,<br />

Budapest, Hungary, August 28 - 31, 2012. Proceedings, pages 87 - 97.<br />

Asynchr<strong>on</strong>uous and Maximally Parallel<br />

Deterministic C<strong>on</strong>trolled N<strong>on</strong>-Cooperative<br />

P Systems Characterize NF IN and coNF IN<br />

Artiom Alhazov 1,2 and Rudolf Freund 3<br />

1 Università degli Studi di Milano-Bicocca<br />

Dipartimento di Informatica, Sistemistica e Comunicazi<strong>on</strong>e<br />

Viale Sarca 336, 20126 Milano, Italy<br />

E-mail: artiom.alhazov@unimib.it<br />

2 Institute of Mathematics and Computer Science<br />

Academy of Sciences of Moldova<br />

Academiei 5, Chişinău MD-2028 Moldova<br />

E-mail: artiom@math.md<br />

3 Faculty of Informatics, Vienna University of Technology<br />

Favoritenstr. 9, 1040 Vienna, Austria<br />

E-mail: rudi@emcc.at<br />

Abstract. <strong>Membrane</strong> systems (with symbol objects) are distributed<br />

c<strong>on</strong>trolled multiset processing systems. N<strong>on</strong>-cooperative P systems with<br />

either promoters or inhibitors (of weight not restricted to <strong>on</strong>e) are known<br />

to be computati<strong>on</strong>ally complete. In this paper we show that the power of<br />

the deterministic subclass of such systems is computati<strong>on</strong>ally complete<br />

in the sequential mode, but <strong>on</strong>ly subregular in the asynchr<strong>on</strong>uous mode<br />

and in the maximally parallel mode.<br />

1 Introducti<strong>on</strong><br />

The most famous membrane computing model where determinism is a criteri<strong>on</strong><br />

of universality versus decidability is the model of catalytic P systems, see [2]<br />

and [5].<br />

It is also known that n<strong>on</strong>-cooperative rewriting P systems with either promoters<br />

or inhibitors are computati<strong>on</strong>ally complete, [1]. Moreover, the proof satisfies<br />

some additi<strong>on</strong>al properties:<br />

– Either promoters of weight 2 or inhibitors of weight 2 are enough.<br />

– The system is n<strong>on</strong>-deterministic, but it restores the previous c<strong>on</strong>figurati<strong>on</strong><br />

if the guess is wr<strong>on</strong>g, which leads to correct simulati<strong>on</strong>s with probability 1.<br />

The purpose of this paper is to formally prove that computati<strong>on</strong>al completeness<br />

cannot be achieved by deterministic systems when working in the asynchr<strong>on</strong>uous<br />

or in the maximally parallel mode.<br />

87

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

Saved successfully!

Ooh no, something went wrong!