Journal of Computer and System Sciences
Structures and Bio-language to Simulate Transition P Systems on Digital Computers
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
A prolog simulator for deterministic P systems with active membranes
New Generation Computing - Membrane computing
DNA13'07 Proceedings of the 13th international conference on DNA computing
Membrame dissolution in distributed architectures of P-systems
ACACOS'11 Proceedings of the 10th WSEAS international conference on Applied computer and applied computational science
Implementation of catalytic p systems
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
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.