Rewriting logic is a simple computational logic that can naturally express both concurrent
computation and logical deduction with great generality. This paper provides a gentle …

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 …

The evolution of simulation and implementation of P systems has been intense since the
theoretical model of computation was created. In the field of software simulation of P …

The formalism of P systems is known for many years, yet just recently new derivation modes
and halting conditions have been proposed. For develo** comparable results, a formal …

This paper presents the newly introduced class of (simple) kernel P systems ((s) kP systems)
and investigates through a 3-colouring problem case study the expressive power and …

We present a detector-pyramid architecture for real-time multi-view face detection. Using a
coarse to fine strategy, the full view is partitioned into finer and finer views. Each face …

In this book the authors present an alternative set theory dealing with a more relaxed notion
of infiniteness, called finitely supported mathematics (FSM). It has strong connections to the …

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 …

Recent research in membrane computing examines and confirms the anticipated modelling
potential of kernel P systems in several case studies. On the one hand, this computational …

In this paper we propose MPP systems as modelling notation for ecological systems, and we
show how they can be used together with simulation and statistical model checking tools to …