Defining and Executing P-systems with Structured Data in K

From FSL

Defining and Executing P-systems with Structured Data in K

Traian Florin Serbanuta, Gheorghe Stefanescu and Grigore Rosu

WMC'08, LNCS 5391, pp 374-393. 2009

Abstract. K is a rewrite-based framework proposed for giving formal executable semantics to programming languages and/or calculi. K de- parts 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 over- lap, 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, for example 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 ob jects in P-systems.

PDF, Experiments, WMC'08 Slides, WMC'08, DOI, BIB