Rewriting logic and its implementation Maude are an expressive framework for the formal
specification and verification of software and other kinds of systems. Concurrency is …

Existing results in membrane computing refer mainly to P systems' characterization of Turing
computability, also to some polynomial solutions to NP-complete problems by using an …

The emergence of terms like natural computing, mimetic computing, parallel problem solving
from nature, bio-inspired computing, neurocomputing, evolutionary computing, etc., shows …

Membrane systems are a biologically-inspired computational model based on the structure
of biological cells and the way chemicals interact and traverse their membranes. Although …

We study the controlled reversibility in reaction systems, a bio-inspired formalism in which
the reactions take place only if some inhibitors are not present. Forward reactions are …

Kernel P systems have been introduced as a unifying formalism allowing to specify, simulate
and analyse various problems. Several applications of this model have been considered …

Membrane computing is a branch of natural computing aiming to abstract computing models
from the structure and functioning of the living cell, and from the way cells cooperate in …

We introduce a variant of P systems where rules have associated a real number providing a
measure for the “intrinsic reactivity” of the rule and roughly corresponding to the kinetic …

This paper presents an approach to P system verification using the Spin model checker. It
proposes a P system implementation in PROMELA, the modeling language accepted by …

Membrane systems represent a new model of computation involving parallel application of
rules, communication between membranes and dissolving. Since rewriting logic is a general …