Simulating Shuffle-Exchange Networks with P Systems

Abstract

We present in this paper a simulation with P systems of the parallel architecture known as shuffle-exchange network. This will lead us to consider a new version of P systems with communication, for which the communication graphs are not fixed, but have a dynamic evolution, and for which different communication rules can be associated to different communication graphs. The simulation of the shuffle{exchange network provides a first, simple example, of such a system.