A six-state minimal time solution to the firing squad synchronization problem
Theoretical Computer Science
Distributed Algorithms
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Firing squad synchronization problem in number-conserving cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Fundamentals of Telecommunications, 2nd Edition
Fundamentals of Telecommunications, 2nd Edition
Operating System Concepts
Fast Synchronization in P Systems
Membrane Computing
On formulations of firing squad synchronization problems
UC'05 Proceedings of the 4th international conference on Unconventional Computation
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Faster synchronization in P systems
Natural Computing: an international journal
Parallel and distributed algorithms in p systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
| Hi-index | 0.00 |
In the field of molecular computing, in particular P systems, synchronization is an essential requirement for composing or sequentially linking together congenial P system activities. We provide an improved deterministic algorithm based on static structures and traditional rules, which runs in 4e + 13 steps, where e is the eccentricity of the initiating cell. Using the same model, extended with the support of cell IDs, we provide another deterministic algorithm, which runs in 3e + 13 steps. Our algorithms use a convenient framework, called P modules, which embraces the essential features of many popular types of P systems.