Fast hardware implementations of p systems

  • Authors:
  • Sergey Verlan;Juan Quiros

  • Affiliations:
  • LACL, Département Informatique, Université Paris Est, Créteil, France;ID2 Group, Department of Electronic Technology, University of Sevilla, Sevilla, Spain

  • Venue:
  • CMC'12 Proceedings of the 13th international conference on Membrane Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this article we present the design of a fast hardware simulator for P systems using the field-programmable gate array (FPGA) technology. The simulator is non-deterministic and it uses a constant time procedure to choose one of the computational paths. The obtained strategy is fair and it is based on a pre-computation of all possible rule applications. This pre-computation is obtained by using the representation of all possible multisets of rules' applications as context-free languages. Then using a standard technique involving formal power series it is possible to obtain the generating series of corresponding languages that permits to construct the structure representing all possible rule applications for any configuration. We give a hardware design implementing some concrete examples and present the obtained results which feature an important speed-up.