A parallel machine for multiset transformation and its programming style
Future Generation Computer Systems
Selected papers of the Second Workshop on Concurrency and compositionality
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
A rewriting logic framework for operational semantics of membrane systems
Theoretical Computer Science
The rewriting logic semantics project
Theoretical Computer Science
Translating Mobile Ambients into P Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Rewriting Logic Approach to Operational Semantics (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational Semantics and Rewriting Logic in Membrane Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
Executable specifications of p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Flattening the transition P systems with dissolution
CMC'10 Proceedings of the 11th international conference on Membrane computing
| Hi-index | 0.00 |
Membrane systems represent a new model of computation involving parallel application of rules, communication between membranes and dissolving. Since rewriting logic is a general framework for concurrent systems, we connect it with the operational semantics of membrane systems. We use a new representation given by register membranes which are able to express the evolution involving rules with promoters and inhibitors. The evolution is expressed in terms of both dynamic and static allocation of resources to rules. It is proved that these semantics are equivalent. Dynamic allocation allows translation of the maximal parallel application of membrane rules into sequential rewritings. An implementation in Maude is provided.