Synchronization of P Systems with Simplex Channels

Autor:	Ipate, Florentin, Nicolescu, Radu, Niculescu, Ionut-Mihai, Stefan, Cristian
Rok vydání:	2011
Předmět:	Computer Science - Distributed Parallel and Cluster Computing Computer Science - Emerging Technologies Computer Science - Formal Languages and Automata Theory
Druh dokumentu:	Working Paper
Popis:	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. Comment: Presented at MeCBIC 2011
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1108.3430 Zobrazit plný text záznamu View this record from Arxiv