Using the Formal Framework for P Systems

In this article we focus on the model called the formal framework for P systems. This model provides a descriptional language powerful enough to represent in a simple way, via a strong bisimulation, most of the variants of P systems. The article presents a series of concrete examples of the application of the formal framework in order to understand, extend, compare and explain different models of P systems leading to new research ideas and open problems.

[1]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[2]  Rudolf Freund,et al.  P Systems Working in the k-Restricted Minimally Parallel Mode , 2008 .

[3]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[4]  Giancarlo Mauri,et al.  Dynamical probabilistic P systems , 2006, Int. J. Found. Comput. Sci..

[5]  Mario J. Pérez-Jiménez,et al.  A computational modeling for real ecosystems based on P systems , 2011, Natural Computing.

[6]  Rudolf Freund,et al.  A Formal Framework for Static (Tissue) P Systems , 2007, Workshop on Membrane Computing.

[7]  Rudolf Freund,et al.  A formalization of membrane systems with dynamically evolving structures , 2013, Int. J. Comput. Math..

[8]  Sergey Verlan.  A Note on the Probabilistic Evolution for P Systems , 2012 .

[9]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

[10]  Oscar H. Ibarra,et al.  Deterministic catalytic systems are not universal , 2006, Theor. Comput. Sci..

[11]  Rudolf Freund,et al.  Flattening in (Tissue) P Systems , 2013, Int. Conf. on Membrane Computing.