No Cycles in Compartments. Starting from Conformon-P Systems

Abstract

Starting from proofs of results about the computing power of conformon- P systems, we infer several results about the power of certain classes of tissue-like P systems with (cooperative) rewriting rules used in an asynchronous way, without cycles in compartments. This last feature is related to an important restriction appearing when dealing with lab implementations of P systems, that of avoiding local evolution loops of objects.