D. Besozzi, C. Ferretti, G. Mauri, C. Zandron
Parallel Rewriting P Systems with Deadlock.
Abstract
We analyze P systems with different parallel methods for string rewriting.
The notion of deadlock state is introduced when some rules with mixed target indications are simultaneously applied on a common string.
The computational power of systems with and without deadlock is analyzed and a lower bound for the generative power is given, for some parallelism methods.
Some open problems are also formulated.