Expressing control mechanisms of membranes by rewriting strategies

Authors:
Oana Andrei;Gabriel Ciobanu;Dorel Lucanu
Affiliations:
INRIA-LORIA, Nancy, France;Faculty of Computer Science, “A.I.Cuza” University of Iaşi;Faculty of Computer Science, “A.I.Cuza” University of Iaşi
Venue:
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Year:
2006

Citing 8
Cited 3

Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Building program optimizers with rewriting strategies

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Towards a Strategy Language for Maude

Electronic Notes in Theoretical Computer Science (ENTCS)
A survey of strategies in rule-based program transformation systems

Journal of Symbolic Computation
Structural operational semantics of p systems

WMC'05 Proceedings of the 6th international conference on Membrane Computing
Encodings and arithmetic operations in membrane computing

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation

Defining and Executing P Systems with Structured Data in K

Membrane Computing
Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions

Electronic Notes in Theoretical Computer Science (ENTCS)
Strategy-Based Proof Calculus for Membrane Systems

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a rewriting semantics of membrane systems based on strategies. We use strategies to describe the control mechanisms in membranes. We provide strategies for maximally parallel rewriting, and for maximally parallel rewriting with priorities between rules. Maximally parallel rewriting with promoters or inhibitors requires an additional encoding of the rules.