IPATE , Florentin

In this paper we present an approach to modelling, verification and testing for cell-like P-systems based on Event-B and the Rodin platform. We present a general framework for modelling P systems using Event-B, which we then use to implement two P-system models in the Rodin platform. For each of the two models, we use the associated Pro-B model...

Although testing is an essential part of software development, until recently, P system testing has been completely neglected. Mutation testing (mutation analysis) is a structural software testing method which involves modifying the program in small ways. Mutation analysis has been largely used in white-box testing, but only a few...

This paper presents an approach for P system testing, that uses model- checking for automatic test generation and P-Lingua as specification language. This approach is based on a transformation of the transitional, non-deterministic, cell-like P system into a Kripke structure, which is further used for test generation, by adding convenient...

This paper presents an approach to P systems verification using the Spin model checker. A tool which implements the proposed approach has been developed and can automatically transform P system specifications from P-Lingua into Promela, the language accepted by the well known model checker Spin. The properties expected for the P system are...

A basic P system, called kernel P system (kP system for short), covering features of different P systems introduced and studied so far is defined and discussed. It is a relatively low level specification system aiming to cover features exhibited by most of the problems modelled so far using P system formalisms. A small set of rules and specific...

This paper presents a testing approach for kernel P systems (kP systems), based on the X-machine testing framework and the concept of cover automaton. The testing methodology ensures that the implementation conforms the speci cations, under certain conditions, such as the identi ably concept in the context of kernel P systems.

P systems are the computational models introduced in the context of membrane computing, a computational paradigm within the more general area of unconventional computing. Kernel P (kP) systems are de ned to unify the speci cation of di erent variants of P systems, motivated by challenging theoretical aspects and the need to model di erent...

A kernel P system (kP system, for short) integrates in a coherent and elegant manner many of the P system features most successfully used for modelling various applications and, consequently, it provides a framework for analyzing these models. In this paper, we illustrate the modeling capabilities of kernel P systems by showing how other...

As unconventional computation matures and non-standard programming frameworks are demonstrated, the need for formal veri cation will become more prevalent. This is so because \programming" in unconventional substrates is di cult. In this paper we show how conventional veri cation tools can be used to verify unconventional programs implementing...

This paper presents a testing approach for kernel P Systems (kP systems), based on test data generation for a given scenario. This method uses Genetic Algorithms to generate the input sets needed to trigger the given computation steps.

The newly introduced Kernel P systems offer an unitary and elegant way of integrating established features of existing P system variants with new elements with potential value for formal modelling. This paper presents a case study illustrating the expressive power and efficiency of kernel P systems on the 3-Col problem. The use of...

Formal verification of P systems using model checking has attracted a significant amount of research in recent years. However, up to now only P systems with static structure have been considered. This paper makes significant advances in this area by considering P systems with active membranes, in particular P systems with division rules....

A basic P system, called kernel P system4 (kP system for short), combining features of di erent P systems introduced and studied so far is de ned and discussed. The structure of such systems is de ned as a dynamic graph, similar to tissue-like P systems, the objects are organised as multisets, and the rules in each compartment, rewriting...

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 efficiency of kernel P systems. It describes two skP systems that model the problem and analyses them in terms of efficiency and complexity. The skP models prove to be...

This paper explores the modelling capacities of a new class of P systems, called kernel P systems (kP systems). A specific language for describing kP systems and its translation into Promela, the specification language of Spin, are described. This Promela specification has been further used for simulation and property verification with the Spin...

This paper presents an integrated approach for model simulation, property extraction and formal veri cation of P systems, illustrated on a tissue P system with active membranes solving the 3-colouring problem. The paper focuses on this problem and reports the invariants and the properties extracted and veri ed using a series of tools (Daikon,...