Operational Semantics and Rewriting Logic in Membrane Computing

被引：6

作者：

Andrei, Oana ^{[1
]}

Lucanu, Dorel ^{[1
]}

Ciobanu, Gabriel ^{[2
]}

机构：

[1] Alexandru Ioan Cuza Univ, Fac Comp Sci, Iasi, Romania

[2] Romanian Acad, Inst Comp Sci, Iasi, Romania

来源：

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2006年 / 156卷 / 01期

关键词：

P system; operational semantics; rewriting logic; Maude;

D O I：

10.1016/j.entcs.2005.10.028

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The existing results in membrane computing refer mainly to the P systems characterization of Turing computability, and to some polynomial solutions to NP-complete problems by using an exponential workspace created in a "biological way". In this paper we define an operational semantics of these P systems, and give a translation of the operational semantics into rewriting logic. We present some results regarding this translation, including an operational correspondence, and discuss why such a translation is relevant in order to take advantage of good features of both structural operational semantics and rewriting logic.

引用

页码：57 / 78

页数：22

共 9 条

[1]

Andrei O., 2005, LNCS, V3365, P127

[2]

ANDREI O, 2005, PREPR 6 INT WORKSH M, P1

[3]

Bonchi C., 2005, P 3 BRAINST WEEK MEM, P63

[4] Distributed algorithms over communicating membrane systems [J].

Ciobanu, G .

BIOSYSTEMS, 2003, 70 (02) :123-133

[5]

Clavel M., 2002, THEORETICAL COMPUTER, V285, P1870

[6]

Meseguer J, 2004, LECT NOTES ARTIF INT, V3097, P1

[7]

Paun Gheorge, 2002, MEMBRANE COMPUTING I

[8]

Pitts A., 1989, LECT NOTES

[9]

Plotkin GD, 2004, J LOGIC ALGEBR PROGR, V60-1, P17, DOI 10.1016/j.jlap.2004.03.002

← 1 →