We present an improved solution for the Firing Squad Synchronization Problem (FSSP) for digraph-structured P systems. We improve our previous FSSP algorithm by allowing the general to delegate a more central cell in the P system to send the final command to synchronize. With e being the eccentricity of the general and r denoting the radius of the underlying digraph, our new algorithm guarantees to synchronize all cells of the system, between e + 2r + 3 steps (for all trees structures and many digraphs) and up to 3e + 7 steps, in the worst case for any digraph. Empirical results show our new algorithm for tree-structured P systems yields at least 20% reduction in the number of steps needed to synchronize over the previous best-known algorithm. © 2012 Springer-Verlag.
CITATION STYLE
Dinneen, M. J., Kim, Y. B., & Nicolescu, R. (2012). An adaptive algorithm for P system synchronization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7184 LNCS, pp. 139–164). https://doi.org/10.1007/978-3-642-28024-5_11
Mendeley helps you to discover research relevant for your work.