Title :
Computational Properties of Two P Systems Solving the 3-colouring Problem
Author :
Turcanu, A. ; Ipate, Florentin
Author_Institution :
Dept. of Comput. Sci., Univ. of Pitesti, Pitesti, Romania
Abstract :
Membrane computing, the research field initiated by Gheorghe Paun 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.
Keywords :
biocomputing; computational complexity; formal verification; graph colouring; 3-colouring problem; MeCoSim; NP-complete problem; ProB model checker; active membranes; computational properties; formal modeling; formal verification; membrane computing simulator; simple kernel P system; tissue P system; Animation; Color; Computational modeling; Kernel; Mathematical model; Model checking; NP-complete problem; 3-colouring problem; Event-B; P system; model checking;
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2012 14th International Symposium on
Conference_Location :
Timisoara
Print_ISBN :
978-1-4673-5026-6
DOI :
10.1109/SYNASC.2012.61