Fast Synchronization in P Systems

We consider the problem of synchronizing the activity of all membranes of a P system. After pointing the connection with a similar problem dealt with in the field of cellular automata, where the problem is called the firing squad synchronization problem , FSSP for short, we provide two algorithms to solve this problem for P systems. One algorithm is non-deterministic and works in 2h + 3 steps, the other is deterministic and works in 3h + 3 steps, where h is the height of the tree describing the membrane structure.