Computer Science – Computational Engineering – Finance – and Science
Scientific paper
2009-11-26
EPTCS 11, 2009, pp. 107-122
Computer Science
Computational Engineering, Finance, and Science
Scientific paper
10.4204/EPTCS.11.7
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.
Dinneen Michael J.
Kim Yun-Bum
Nicolescu Radu
No associations
LandOfFree
New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-116137