How to Synchronize the Activity of All Components of a P System?

We consider the problem of synchronizing the activity of all the membranes of a P system. After pointing at 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. One algorithm is non-deterministic and it works in the time 3h, where h is the height of the tree defining the membrane structure of the considered P system. The other algorithm is deterministic and it works in time 4n + 2h, where n is the number of membranes of the considered P system. Finally, we suggest various directions to continue this work.

[1]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[2]  Gabriel Ciobanu.  Distributed algorithms over communicating membrane systems. , 2003, Bio Systems.

[3]  Maurice Margenstern,et al.  An algorithm for building intrinsically universal cellular automata in hyperbolic spaces , 2022 .

[4]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[5]  Jean-Baptiste Yunès,et al.  Seven-State Solutions to the Firing Squad Synchronization Problem , 1994, Theor. Comput. Sci..

[6]  Hiroshi Umeo,et al.  An Efficient Mapping Scheme for Embedding Any One-Dimensional Firing Squad Synchronization Algorithm onto Two-Dimensional Arrays , 2002, ACRI.

[7]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[8]  Jacques Mazoyer,et al.  A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem , 1987, Theor. Comput. Sci..

[9]  Gavin Sherlock,et al.  Reply: whole-culture synchronization - effective tools for cell cycle studies. , 2004, Trends in biotechnology.

[10]  Maurice Margenstern,et al.  Time and Space Complexity Classes of Hyperbolic Cellular Automata , 2004, IEICE Trans. Inf. Syst..

[11]  Gabriel Ciobanu,et al.  Membrane Systems and Distributed Computing , 2002, WMC-CdeA.

[12]  Vincenzo Manca,et al.  P Systems with Boundary Rules , 2002, WMC-CdeA.

[13]  Thomas Worsch,et al.  The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA , 2004, IFIP TCS.