Abstract:
In the eld of molecular computing, in particular P systems, synchronization
is an important requirement for composing or sequentially linking together conge-
nial P system activities. We provide a deterministic algorithm to the Firing Squad
Synchronization Problem, for digraph-based P systems, which runs in 3e+11 steps,
where e is the eccentricity of the initiator. Our algorithm uses a convenient frame-
work, called simple P modules, which embraces the essential features of several
popular types of P systems