A Petri nets view of synchronized P systems

Abstract Synchronized P systems are P systems where a relation among noncooperative rules establishes that certain rules have to be primarily applied in a synchronous way, and if this is not possible, then they cannot be applied. Thus, certain evolution in the system is excluded, and this allows to gain Turing equivalence without resorting to additional ingredient (like cooperation, division, and catalysts). The relation between various kind of P system and Petri nets has been extensively explored. In this paper, we study the relationship between this sort of P system and Petri nets with read arcs giving an encoding of these P system into nets with a suitable structure.