Defining and executing P systems with structured data in K

Traian Serbǎnuţǎ, Gheorghe Ştefǎnescu, Grigore Roşu

Research output: Contribution to journalConference article

Abstract

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.

Original languageEnglish (US)
Pages (from-to)374-393
Number of pages20
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5391 LNCS
DOIs
StatePublished - Feb 23 2009
Event9th International Workshop on Membrane Computing, WMC 2008 - Edinburgh, United Kingdom
Duration: Jul 28 2008Jul 31 2008

Fingerprint

P Systems
Semantics
Computer programming languages
Formal Semantics
Overlap
Maude
Multiset
Parallel Applications
Rewriting
Programming Languages
Computational Results
Calculus
Framework
Modeling

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Defining and executing P systems with structured data in K. / Serbǎnuţǎ, Traian; Ştefǎnescu, Gheorghe; Roşu, Grigore.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 5391 LNCS, 23.02.2009, p. 374-393.

Research output: Contribution to journalConference article

@article{a1072988ffe84500adec6dcdf93d7ca2,
title = "Defining and executing P systems with structured data in K",
abstract = "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.",
author = "Traian Serbǎnuţǎ and Gheorghe Ştefǎnescu and Grigore Roşu",
year = "2009",
month = "2",
day = "23",
doi = "10.1007/978-3-540-95885-7_26",
language = "English (US)",
volume = "5391 LNCS",
pages = "374--393",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Defining and executing P systems with structured data in K

AU - Serbǎnuţǎ, Traian

AU - Ştefǎnescu, Gheorghe

AU - Roşu, Grigore

PY - 2009/2/23

Y1 - 2009/2/23

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=60349085972&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=60349085972&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-95885-7_26

DO - 10.1007/978-3-540-95885-7_26

M3 - Conference article

AN - SCOPUS:60349085972

VL - 5391 LNCS

SP - 374

EP - 393

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -