Scenario Based P Systems

In this paper we define and study Scenario Based P Systems, a model of computation inspired by the metabolic pathways and networks. Starting from the classical definition of P systems with symbol objects and multiset rewriting rules, we define regular expressions able to capture the causal dependencies among different executions of the rules. The results show the computational power of this model.

[1]  Gabriel Ciobanu,et al.  Quantitative Causality in Membrane Systems , 2011, Int. Conf. on Membrane Computing.

[2]  Dragos Sburlan.  P Systems with Chained Rules , 2011, Int. Conf. on Membrane Computing.

[3]  Gabriel Ciobanu,et al.  Flattening the Transition P Systems with Dissolution , 2010, Int. Conf. on Membrane Computing.

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

[5]  Gabriel Ciobanu,et al.  Events, Causality, and Concurrency in Membrane Systems , 2007, Workshop on Membrane Computing.

[6]  Nivat G. Päun,et al.  Handbook of Formal Languages , 2013, Springer Berlin Heidelberg.

[7]  Nadia Busi,et al.  Causality in Membrane Systems , 2007, Workshop on Membrane Computing.

[8]  Artiom Alhazov,et al.  Membrane Computing , 2013, Lecture Notes in Computer Science.