2011/08/17 by Florentin Ipate, Radu Nicolescu, Ipate, Florentin +5
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Cellular Automata and Applications #DNA and Biological Computing #Distributed #Emerging Technologies (cs.ET) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Modular Robots and Swarm Intelligence #Parallel #and Cluster Computing (cs.DC) #cs.DC #cs.ET #cs.FL
paper · pdf · doi:10.48550/arxiv.1108.3430
Presented at MeCBIC 2011
arxiv created 2011/08/17 · openalex publication_date 2011/08/17 · arxiv updated 2011/08/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We solve the Firing Squad Synchronization Problem (FSSP), for P systems based on digraphs with simplex channels, where communication is restricted by the direction of structural arcs. Previous work on FSSP for P systems focused exclusively on P systems with duplex channels, where communication between parents and children is bidirectional. Our P solution, the first for simplex channels, requires cell IDs, strongly connected digraphs and some awareness of the local topology (such as each cell's outdegree)---we argue that these requirements are necessary. Compared to the known solutions for cellular automata, our solution is substantially simpler and faster.