Synchronization of P Systems with Simplex Channels

Details Synchronization of P Systems with Simplex Channels Synchronization of P Systems with Simplex Channels

2011-08-17

arxiv.org/abs/1108.3430v1

Computer Science

Distributed, Parallel, and Cluster Computing

Presented at MeCBIC 2011

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Synchronization of P Systems with Simplex Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Synchronization of P Systems with Simplex Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Synchronization of P Systems with Simplex Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-540124