arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1108.3430cs.DCcs.ETcs.FL
收藏

单通道P系统的同步

Synchronization of P Systems with Simplex Channels

Florentin Ipate, Radu Nicolescu, Ionut-Mihai Niculescu, Cristian Stefan

摘要:

我们解决了射击队同步问题(FSSP),P系统的基础上有向图与单工通道,其中通信是由结构弧的方向限制。以前的工作FSSP的P系统专注于与双工信道的P系统,父母和孩子之间的通信是双向的。我们的P解决方案,第一个单工通道,需要小区ID,强连接的有向图和一些本地拓扑结构(如每个单元格的出度)的认识-我们认为,这些要求是必要的。与已知的细胞自动机的解决方案相比,我们的解决方案是相当简单和快速。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑