Rewriting Logic-Based Semantics of P Systems and the Maximal Concurrency

We use distributed labeled transition systems and their modal logics in order to compare the concurrency degrees of the P systems and their encoding as rewrite theories in rewriting logic. We show that the maximal concurrency given by the maximal parallel rewriting semantics of the P systems can be expressed in rewriting logic only by interleaving semantics. The maximal concurrency of the membrane interactions is only partially captured.