Scenario Based P Systems

被引：0

作者：

Ciobanu, Gabriel ^{[1
]}

Sburlan, Dragos ^{[1
]}

机构：

[1] Romanian Acad, Inst Comp Sci, Iasi 700505, Romania

来源：

INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING | 2013年 / 9卷 / 5-6期

关键词：

Membrane computing; metabolic pathways; scenarios; regular expressions; causality; computational power; CAUSALITY;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we introduce and study Scenario Based P Systems in order to model computation inspired by metabolic pathways and networks. Starting from the classical definition of P systems with symbol objects and multiset rewriting rules, we use regular expressions able to capture the causal dependencies among different executions of the rules. For SBP systems we define the synchronisation degree and based on it and on the types of the rules that are used we study their computational capabilities.

引用

页码：351 / 366

页数：16

共 8 条

[1] Agrigoroaiei O., 2012, LECT NOTES COMPUTER, V7184, P62
[2] Agrigoroaiei O, 2010, LECT NOTES COMPUT SC, V6501, P53, DOI 10.1007/978-3-642-18123-8_7
[3] [Anonymous], 2002, Membrane Computing. An Introduction
[4] Busi N, 2007, LECT NOTES COMPUT SC, V4860, P160
[5] Ciobanu G, 2007, LECT NOTES COMPUT SC, V4860, P209
[6] Minsky M. L., 1967, Computation: Finite and Infinite Machines
[7] Rozenberg G., 2004, HDB FORMAL LANGUAGES
[8] Sburlan Dragos, 2012, MEMBRANE COMPUTING, V7184, P359

← 1 →