REWRITING LOGIC-BASED SEMANTICS OF P SYSTEMS AND THE MAXIMAL CONCURRENCY

被引：1
作者：
Lucanu, Dorel [1 ]
机构：
[1] Alexandru Ioan Cuza Univ, Fac Comp Sci, Iasi 700483, Romania
来源：
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2009年 / 20卷 / 03期
关键词：
Rewriting logic; P systems; maximal concurrency; membrane computing; MEMBRANE SYSTEMS; TRUE-CONCURRENCY; CAUSALITY;
D O I：
10.1142/S0129054109006644
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We use distributed labeled transition systems and their modal logics in order to compare the concurrency degrees of the P systems and their encoding as rewrite theories in rewriting logic. We show that the maximal concurrency given by the maximal parallel rewriting semantics of the P systems can be expressed in rewriting logic only by interleaving semantics. The maximal concurrency of the membrane interactions is only partially captured.
引用
收藏
页码：395 / 410
页数：16
相关论文
共 50 条
12345