A six-state minimal time solution to the firing squad synchronization problem
Theoretical Computer Science
Seven-state solutions to the Firing Squad Synchronization Problem
Theoretical Computer Science
Membrane Computing: An Introduction
Membrane Computing: An Introduction
ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry
Computation: finite and infinite machines
Computation: finite and infinite machines
UC'10 Proceedings of the 9th international conference on Unconventional computation
Discovering the membrane topology of hyperdag p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
An adaptive algorithm for p system synchronization
CMC'11 Proceedings of the 12th international conference on Membrane Computing
| Hi-index | 0.00 |
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.