Modeling, Verification and Testing of P Systems Using Rodin and ProB

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 checker to verify properties and we present some of the results obtaine

3-Col problem modelling using simple kernel P systems

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 more succinct (in terms of number of rules, objects, number of cells and execution steps) than the corresponding tissue P system, available in the literature, that solves the same problem, at the expense of a greater length of the rules.Ministerio de Ciencia e Innovación TIN2009–13192Junta de Andalucía P08-TIC-0420

Towards an Integrated Approach for Model Simulation, Property Extraction and Veri cation of P Systems

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, MeCoSim, Maple, Spin, ProB) and languages (P{Lingua, Promela, Event-B). Appropriate tools and integration plugins, which facilitate and even automate the steps involved in the aforementioned approach, have also been developed. The case study chosen is complex (it involves an exponential growth of the number of states through the use of membrane division rules) and the properties obtained are non-trivial.Ministerio de Ciencia e Innovación TIN2009–13192Junta de Andalucía P08–TIC–0420

Computational properties of two P systems solving the 3-colouring problem

Abstract-Membrane computing, the research field initiated by Gheorghe Pȃun in 1998, defines computational models, called P systems, inspired by the behavior and structure of the living cell. Many variants of P systems have been introduced and also used as formal modeling and verification tools. Recently, kernel P systems were introduced as an unifying framework for P systems, which integrates many features of existing P system variants into an elegant and yet powerful modeling formalism. In this paper, we consider a tissue P system with active membranes and a simple kernel P system, both of them solving an NP-complete problem, the 3-colouring problem. In order to compare these two models,we determine, for both of them, the values of the variables corresponding to the colors in a number of particular cases using MeCoSim, a membrane computing simulator, and we deduce some of their nontrivial computational properties. The two models are also implemented in Event-B and properties are formally verified using the ProB model checker associated with the Rodin platform