We consider rewriting P systems with parallel application of evolution rules, where no conflicts on the communication of objects can arise. Different parallelism methods are used and only rules which have the same target indication can be simultaneously applied to a common string. The computational power is analyzed, with respect to Lindenmayer systems, and some relations among different parallel rewriting P systems are studied. Some open problems are also formulated.
Parallel rewriting P systems without target conflicts / D. Besozzi, G. Mauri, C. Zandron - In: Membrane Computing: International Workshop, WMC-CdeA 2002 : Curtea de Arges, Romania, August 19-23, 2002 : Revised Papers / G. Paun, G. Rozenberg, A. Salomaa, C. Zandron. - Berlin : Springer-Verlag, 2003. - ISBN 3540006117. - pp. 119-133 (( convegno Membrane Computing International Workshop - WMC- CdeA2002 tenutosi a Curtea de Arges, Romania nel 2002.
Parallel rewriting P systems without target conflicts
D. BesozziPrimo
;
2003
Abstract
We consider rewriting P systems with parallel application of evolution rules, where no conflicts on the communication of objects can arise. Different parallelism methods are used and only rules which have the same target indication can be simultaneously applied to a common string. The computational power is analyzed, with respect to Lindenmayer systems, and some relations among different parallel rewriting P systems are studied. Some open problems are also formulated.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
