A Software Simulation of Transition P Systems in Haskell

P systems are a parallel and distributed computational model, based on the membrane structure notion. Membranes define regions. Inside regions, objects and rules are placed in order to make evolve the P system. Evolution is achieved by transitions between two consecutive system configurations. Therefore, a computation can be obtained as a transitions series between consecutive configurations. Where and how P systems can be implemented is nowadays an open problem, but implementation on digital computers could be one way to show the capabilities of such systems. This paper presents a transition P systems implementation in Haskell, based on a theoretical framework previously developed.