We identify a family of decision problems that are hard for some complexity
classes defined in terms of P systems with active membranes working in polynomial time.
Furthermore, we prove the completeness of these problems in the case where the systems
are equipped with a form of priority that linearly orders their rules. Finally, we highlight
some possible connections with open problems related to the computational complexity
of P systems with active membranes
