Formal verification of p systems with active membranes through model checking

Authors:
Florentin Ipate;Raluca Lefticaru;Ignacio Pérez-Hurtado;Mario J. Pérez-Jiménez;Cristina Tudose
Affiliations:
Department of Computer Science, University of Pitesti, Pitesti, Romania;Department of Computer Science, University of Pitesti, Pitesti, Romania;Research Group on Natural Computing, Dept. of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Dept. of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Department of Computer Science, University of Pitesti, Pitesti, Romania
Venue:
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Year:
2011

Citing 15
Cited 0

Model checking

Model checking
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Complexity classes in models of cellular computing with membranes

Natural Computing: an international journal
A fast P system for finding a balanced 2-partition

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Applications of Membrane Computing (Natural Computing Series)

Applications of Membrane Computing (Natural Computing Series)
Principles of the Spin Model Checker

Principles of the Spin Model Checker
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing
A hybrid approach to modeling biological systems

WMC'07 Proceedings of the 8th international conference on Membrane computing
A logarithmic bound for solving subset sum with P systems

WMC'07 Proceedings of the 8th international conference on Membrane computing
On the decidability of model-checking for P systems

Journal of Automata, Languages and Combinatorics
Towards probabilistic model checking on p systems using PRISM

WMC'06 Proceedings of the 7th international conference on Membrane Computing
On model-checking of p systems

UC'05 Proceedings of the 4th international conference on Unconventional Computation
Executable specifications of p systems

WMC'04 Proceedings of the 5th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. The paper presents a theoretical framework for addressing this problem and reports on a complex case study involving a well-known NP-complete problem solved using P systems with membrane division rules. This is implemented in Promela and non trivial properties are verified using Spin.