People
Strategy-based Rewriting Logic Semantics of P Systems
Strategy-based Rewriting Logic is a combination
between rewrite theories, strategies, and strategy controllers.
The intuition behind a strategy controller is that it decides which
strategy is applied in the current state.
We refer to the set of evolution rules of a membrane as a
control-free membrane. Similarly, by a control-free
membrane system we refer to the set of evolution rules of a
membrane system. A control-free membrane (system) is specified by a
rewrite theory in RWL. Based on the current state, a strategy
controller produces a strategy (called evolution strategy)
describing the possibly next one-step evolutions.
Download
The archive
srl_membrane.zip includes the following files:
- _strategy.maude - the API for Maude Strategy Language,
- membrane.maude - the strategy-based rewrite theory describing membranes and the interface,
- a set of several examples of membrane systems (exi.maude).
In order to run examples, start the Maude system (version 2.3 or later), load
full-Maude, load
membrane.maude
(this automatically loads
_strategy.maude), and then load examples one by one.
Publications
- Strategy-Based Proof Calculus for Membrane Systems by O. Andrei and D. Lucanu. Proceedings of WRLA 2008,
pages 17-34, 2008. To appear in ENTCS.
- Strategy-Based Rewrite Semantics for Membrane Systems
Preserves Maximal Concurrency of Rewrite Actions by D. Lucanu.
7th International Workshop on Reduction Strategies in
Rewriting and Programming (WRS'08), pages 16-30, 2008. To appear in ENTCS.
- Rewriting Logic-based Semantics of Membrane Systems and the
Maximal Concurrency by D. Lucanu. Proceedings of Prague International
Workshop on Membrane Computing, pages 23-34, 2008.
Rewriting Logic Semantics of P Systems
We have defined an operational semantics of a basic class of P systems and we implemented it using rewriting logic.
The structure and behavior of a P system is described by means of an executable specifications in Maude, a software system supporting rewriting and equational logic. We can verify properties of the system expressed as linear temporal logic formulas by using the model checker implemented in Maude.
Download
The algebraic specifications for the syntax and the semantics are available at
this page.
Demo
We provide some
examples with complete details of their execution in Maude and analysis.