Defining and Executing P Systems with Structured Data in K

K is a rewrite-based framework proposed for giving formal executable semantics to programming languages and/or calculi. K departs from other rewrite-based frameworks in two respects: (1) it assumes multisets and lists as builtin, the former modeling parallel features, while the latter sequential ones; and (2) the parallel application of rewriting rules is extended from non-overlapping rules to rules which may overlap, but on parts which are not changed by these rules (may overlap on "read only" parts). This paper shows how P systems and variants can be defined as K (rewrite) systems. This is the first representation of P systems into a rewrite-based framework that captures the behavior (reaction steps) of the original P system step-for-step. In addition to providing a formal executable semantic framework for P systems, the embedding of P systems as K systems also serves as a basis for experimenting with and developing new extensions of P systems, e.g., with structured data. A Maude-based application for executing P systems defined in K has been implemented and experimented with; initial results show computational advantages of using structured objects in P systems.

[1]  Gheorghe Paun.  P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..

[2]  Narciso Martí-Oliet,et al.  Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..

[3]  Grigore Rosu,et al.  A K Definition of Scheme , 2007 .

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

[5]  Gabriel Ciobanu,et al.  Structural Operational Semantics of P Systems , 2005, Workshop on Membrane Computing.

[6]  Gheorghe Paun,et al.  Introduction to Membrane Computing , 2006, Applications of Membrane Computing.

[7]  Grigore Rosu,et al.  A Rewrite Framework for Language Definitions and for Generation of Efficient Interpreters , 2006, WRLA.

[8]  Gabriel Ciobanu,et al.  Operational Semantics and Rewriting Logic in Membrane Computing , 2006, Electron. Notes Theor. Comput. Sci..

[9]  Daniel Le Métayer,et al.  A parallel machine for multiset transformation and its programming style , 1988, Future Gener. Comput. Syst..

[10]  Grigore Rosu,et al.  KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis , 2007, RTA.

[11]  Elaine J. Weyuker,et al.  Computability, complexity, and languages , 1983 .

[12]  Ian Stark,et al.  The Continuous pi-Calculus: A Process Algebra for Biochemical Modelling , 2008, CMSB.

[13]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[14]  Luca Cardelli,et al.  Brane Calculi , 2004, CMSB.

[15]  Pierluigi Frisco,et al.  The conformon-P system: a molecular and cell biology-inspired computability model , 2004, Theor. Comput. Sci..

[16]  Gabriel Ciobanu,et al.  Expressing Control Mechanisms of Membranes by Rewriting Strategies , 2006, Workshop on Membrane Computing.

[17]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[18]  A. V. Grimstone.  Molecular biology of the cell (3rd edn) , 1995 .

[19]  Gabriel Ciobanu,et al.  P transducers , 2009, New Generation Computing.

[20]  J. Davies,et al.  Molecular Biology of the Cell , 1983, Bristol Medico-Chirurgical Journal.

[21]  Gabriel Ciobanu,et al.  A rewriting logic framework for operational semantics of membrane systems , 2007, Theor. Comput. Sci..

[22]  Grigore Rosu,et al.  K: A Rewriting-Based Framework for Computations -- Preliminary version -- , 2007 .

[23]  Andrei Paun,et al.  The power of communication: P systems with symport/antiport , 2002, New Generation Computing.

[24]  Philip Wadler.  Call-by-Value Is Dual to Call-by-Name - Reloaded , 2005, RTA.

[25]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[26]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[27]  Elaine J. Weyuker,et al.  Computability, complexity, and languages - fundamentals of theoretical computer science , 2014, Computer science and applied mathematics.

[28]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.