New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems

We propose two uniform solutions to an open question: the Firing Squad Synchronization Problem (FSSP), for hyperdag and symmetric neural P systems, with anonymous cells. Our solutions take e_c+5 and 6e_c+7 steps, respectively, where e_c is the eccentricity of the commander cell of the dag or digraph underlying these P systems. The first and fast solution is based on a novel proposal, which dynamically extends P systems with mobile channels. The second solution is substantially longer, but is solely based on classical rules and static channels. In contrast to the previous solutions, which work for tree-based P systems, our solutions synchronize to any subset of the underlying digraph; and do not require membrane polarizations or conditional rules, but require states, as typically used in hyperdag and neural P systems.

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

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

[3]  Kojiro Kobayashi,et al.  On Formulations of Firing Squad Synchronization Problems , 2005, UC.

[4]  Gheorghe Paun,et al.  Introduction to Membrane Computing , 2006, Applications of Membrane Computing.

[5]  Kenichiro Noguchi Simple 8-state minimal time solution to the firing squad synchronization problem , 2004, Theor. Comput. Sci..

[6]  Roger L. Freeman Fundamentals of Telecommunications: Freeman/Telecommunications 2e , 2005 .

[7]  Radu Nicolescu,et al.  Discovering the Membrane Topology of Hyperdag P Systems , 2009, Workshop on Membrane Computing.

[8]  Abraham Silberschatz,et al.  Operating System Concepts 7th Edition with Java 7th Edition , 2006 .

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

[10]  Gavin Brooks,et al.  Cell cycle control: mechanisms and protocols , 2005 .

[11]  Artiom Alhazov,et al.  Fast Synchronization in P Systems , 2009, Workshop on Membrane Computing.

[12]  Radu Nicolescu,et al.  Structured Modelling with Hyperdag~P~Systems: Part B , 2009 .

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

[14]  Marian Gheorghe,et al.  How to Synchronize the Activity of All Components of a P System? , 2008, Int. J. Found. Comput. Sci..

[15]  Helge Szwerinski Time-Optimal Solution of the Firing-Squad-Synchronization-Problem for n-Dimensional Rectangles with the General at an Arbitrary Position , 1982, Theor. Comput. Sci..

[16]  Abraham Silberschatz,et al.  Operating System Concepts, 5th Edition , 1994 .